Authors: Mihaljević, Miodrag J. 
Fossorier, Marc P. C.
Imai, Hideki
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Fast correlation attack algorithm with list decoding and an application
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 2355
First page: 196
Last page: 210
Issue Date: 1-Jan-2002
Rank: M22
ISBN: 978-3-540-43869-4
ISSN: 0302-9743
DOI: 10.1007/3-540-45473-X_17
An improved method for the fast correlation attack on certain stream ciphers is presented. The proposed algorithm employs the followingdeco dingapproac hes: list decodingin which a candidate is assigned to the list based on the most reliable information sets, and minimum distance decodingbased on Hammingdistance. Performance and complexity of the proposed algorithm are considered. A desirable characteristic of the proposed algorithm is its theoretical analyzibility, so that its performance can also be estimated in cases where corresponding experiments are not feasible due to the current technological limitations. The algorithm is compared with relevant recently reported algorithms, and its advantages are pointed out. Finally, the proposed algorithm is considered in a security evaluation context of a proposal (NESSIE) for stream ciphers.
Keywords: Cryptanalysis | Keystream generators | Linear feedback shift registers | Nonlinear combiner | Nonlinear filter | Stream ciphers
Publisher: Springer Link

Show full item record


checked on May 17, 2024

Page view(s)

checked on May 10, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.