Sciweavers

22018 search results - page 4149 / 4404
» or 2004
Sort
View
CRYPTO
2004
Springer
128views Cryptology» more  CRYPTO 2004»
16 years 1 days ago
Faster Correlation Attack on Bluetooth Keystream Generator E0
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...
Yi Lu 0002, Serge Vaudenay
CRYPTO
2004
Springer
112views Cryptology» more  CRYPTO 2004»
16 years 1 days ago
Feistel Schemes and Bi-linear Cryptanalysis
Abstract. In this paper we introduce the method of bi-linear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased character...
Nicolas Courtois
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 1 days ago
Round-Optimal Secure Two-Party Computation
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...
Jonathan Katz, Rafail Ostrovsky
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
16 years 1 days ago
Signed Binary Representations Revisited
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...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
159
Voted
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
16 years 1 days ago
Security of Random Feistel Schemes with 5 or More Rounds
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...
Jacques Patarin
« Prev « First page 4149 / 4404 Last » Next »