By Topic

Iterative optimum symbol-by-symbol decoding and fast correlation attacks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
J. Dj. Golic ; Sch. of Electr. Eng., Belgrade Univ., Serbia

The relation between fast correlation attacks on stream ciphers based on linear feedback shift registers (LFSRs) and the Hartmann-Rudolph (1976) algorithm for optimal symbol-by-symbol decoding of linear block codes is theoretically investigated. By iterating approximate versions of the HR algorithm, novel iterative probabilistic decoding algorithms for fast correlation attacks are developed. In particular, these algorithms can be applied when a large number of nonorthogonal parity checks are used. A number of properties of the proposed iterated versions of the HR algorithm including convergence conditions and critical bit error rates are derived

Published in:

IEEE Transactions on Information Theory  (Volume:47 ,  Issue: 7 )