11 search results - page 1 / 3 » From Non-Adaptive to Adaptive Pseudorandom Functions |
IACR
2011
12 years 4 months ago
2011
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
CCS
2010
ACM
13 years 5 months ago
2010
ACM
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade constructio...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Within the security architecture of the 3GPP system there is a standardised encryption mode f8 based on the block cipher KASUMI. In this work we examine the pseudorandomness of the...