Fast correlation attack algorithm with list decoding and an application

Abstract

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.