Iterative optimum symbol-by-symbol decoding and fast correlation attacks
From MaRDI portal
Publication:4544751
DOI10.1109/18.959285zbMath1001.94028OpenAlexW2133229878MaRDI QIDQ4544751
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
linear block codesstream cipherfast correlation attacksprobabilistic decoding algorithmsHartmann-Rudolph algorithmHartmann-Rudolph decoding
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (2)
This page was built for publication: Iterative optimum symbol-by-symbol decoding and fast correlation attacks