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

DOI10.1109/18.959285MaRDI QIDQ4544751zbMATH OpenOpenAlexFDO

Authors J. Dj. Golić

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.959285

zbMATH Keywords

fast correlation attacksHartmann-Rudolph algorithmHartmann-Rudolph decodinglinear block codesprobabilistic decoding algorithmsstream cipher

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Fast correlation attacks based on turbo code techniques
• A low-complexity and high-performance algorithm for the fast correlation attack
• An analysis and an improvement of iterative fast correlation attacks
• Fast correlation attack algorithm with list decoding and an application
• Improved fast correlation attacts using parity-check equations of weight 4 and 5

Cited in

(5)

• A survey on fast correlation attacks
• An analysis and an improvement of iterative fast correlation attacks
• An Improved Fast Correlation Attack on Stream Ciphers
• Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic applications
• Fast correlation attacks based on turbo code techniques

This page was built for publication: Iterative optimum symbol-by-symbol decoding and fast correlation attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544751)