Sciweavers

397 search results - page 2 / 80
» Pseudorandom Functions and Lattices
Sort
View
EUROCRYPT
2000
Springer
13 years 8 months ago
The Sum of PRPs Is a Secure PRF
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...
Stefan Lucks
EUROCRYPT
2006
Springer
13 years 8 months ago
Luby-Rackoff Ciphers from Weak Round Functions?
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived fr...
Ueli M. Maurer, Yvonne Anne Oswald, Krzysztof Piet...
IJNSEC
2006
84views more  IJNSEC 2006»
13 years 5 months ago
Security on Generalized Feistel Scheme with SP Round Function
This paper studies the security against differential/linear cryptanalysis and the pseudorandomness for a class of generalized Feistel scheme with SP round function called GFSP. We ...
Wenling Wu, Wentao Zhang, Dongdai Lin
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
CRYPTO
1998
Springer
137views Cryptology» more  CRYPTO 1998»
13 years 9 months ago
Building PRFs from PRPs
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...