A survey on fast correlation attacks
From MaRDI portal
Publication:2376656
DOI10.1007/s12095-012-0062-xzbMath1285.94037OpenAlexW2017931540MaRDI QIDQ2376656
Martin Hell, Thomas Johansson, Carl Löndahl, Martin Ågren
Publication date: 24 June 2013
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-012-0062-x
Related Items
Survey of information security, Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications], FASER128: Cryptanalysis and Its Countermeasure, Attacks Against Filter Generators Exploiting Monomial Mappings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast correlation attacks on certain stream ciphers
- Fast Correlation Attacks: Methods and Countermeasures
- Fast Correlation Attack Algorithm with List Decoding and an Application
- A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence
- Fast evaluation of logarithms in fields of characteristic two
- An Improved LPN Algorithm
- Modeling Block Decoding Approaches for the Fast Correlation Attack
- On A Fast Correlation Attack on Certain Stream Ciphers
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- An optimum symbol-by-symbol decoding rule for linear codes
- Codes Which Detect Deception
- Iterative optimum symbol-by-symbol decoding and fast correlation attacks
- Correlation attacks on stream ciphers: Computing low-weight parity checks based on error-correcting codes
- Computation of low-weight parity checks for correlation attacks on stream ciphers
- Cryptography and Coding
- Multi-pass Fast Correlation Attack on Stream Ciphers
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- Noise-tolerant learning, the parity problem, and the statistical query model
- Topics in Cryptology – CT-RSA 2004