Sciweavers

5 search results - page 1 / 1
» Derandomized Constructions of k-Wise (Almost) Independent Pe...
Sort
View
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
13 years 10 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold
FOCS
1990
IEEE
13 years 9 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
ECCC
2011
282views ECommerce» more  ECCC 2011»
12 years 11 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
CTRSA
2006
Springer
104views Cryptology» more  CTRSA 2006»
13 years 8 months ago
A New Criterion for Nonlinearity of Block Ciphers
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
Orr Dunkelman, Nathan Keller
ASIACRYPT
2007
Springer
13 years 9 months ago
On Efficient Message Authentication Via Block Cipher Design Techniques
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
Goce Jakimoski, K. P. Subbalakshmi