55 search results - page 9 / 11 » crypto 2004 |
CRYPTO
2004
Springer
14 years 25 days ago
2004
Springer
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
CRYPTO
2004
Springer
14 years 25 days ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
CRYPTO
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
CRYPTO
2004
Springer
14 years 25 days ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
FSE
2006
Springer
13 years 11 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...