Reference : An Improved Fast Correlation Attack on Stream Ciphers
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Engineering, computing & technology : Multidisciplinary, general & others
An Improved Fast Correlation Attack on Stream Ciphers
Zhang, Bin [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Feng, Dengguo [State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences]
Selected Areas in Cryptography
Lecture Notes in Computer Science, 5381
15th International Workshop, SAC 2008
August 14-15,2008
Sackville, NB
[en] At Crypto’2000, Johansson and Jönsson proposed a fast correlation attack on stream ciphers based on the Goldreich-Rubinfeld-Sudan algorithm. In this paper we show that a combination of their approach with techniques for substituting keystream and evaluating parity-checks gives us the most efficient fast correlation attack known so far. An application of the new algorithm results in the first-known near-practical key recovery attack on the shrinking generator with the parameters suggested by Krawczyk in 1994, which was verified in the 40-bit data LFSR case for which the only previously known efficient attacks were distinguishing attacks.

File(s) associated to this reference

Fulltext file(s):

Limited access
Zhang.pdfPublisher postprint323.79 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.