Computation of low-weight parity checks for correlation attacks on stream ciphers
From MaRDI portal
Publication:4608500
DOI10.1007/3-540-60693-9_10zbMath1383.94038MaRDI QIDQ4608500
G. J. Kühn, Walter T. Penzhorn
Publication date: 21 March 2018
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60693-9_10
computational complexity; Zech's logarithm; Coppersmith's algorithm; discrete logarithm of field elements; table size; weight-4 polynomials
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
A new approach for finding low-weight polynomial multiples, A survey on fast correlation attacks, Results on multiples of primitive polynomials and their products over GF(2), An analysis and an improvement of iterative fast correlation attacks
Cites Work
- Probability to meet in the middle
- Fast correlation attacks on certain stream ciphers
- Some comments on Zech's logarithms
- Fast evaluation of logarithms in fields of characteristic two
- Computing Logarithms in Finite Fields of Characteristic Two
- On A Fast Correlation Attack on Certain Stream Ciphers
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item