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

DOI10.1109/18.959285zbMATH Open1001.94028OpenAlexW2133229878MaRDI QIDQ4544751FDOQ4544751

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

Recommendations

• Publication:4941855
• scientific article; zbMATH DE number 1759271
• 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

zbMATH Keywords

stream cipherfast correlation attackslinear block codesprobabilistic decoding algorithmsHartmann-Rudolph algorithmHartmann-Rudolph decoding

Mathematics Subject Classification ID

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

Cited In (5)

• A survey on fast correlation attacks
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Improved Fast Correlation Attack on Stream Ciphers
• An analysis and an improvement of iterative fast correlation attacks

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)