116 search results - page 6 / 24 » Min-Wise Independent Permutations |
EUROCRYPT
2000
Springer
14 years 4 days ago
2000
Springer
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...
ASPDAC
1995
ACM
14 years 3 days ago
1995
ACM
IACR
2011
12 years 8 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
ASIACRYPT
2007
Springer
14 years 2 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
SACRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...