Computation of low-weight parity checks for correlation attacks on stream ciphers

DOI10.1007/3-540-60693-9_10zbMath1383.94038OpenAlexW1556953215MaRDI 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

zbMATH Keywords

computational complexityZech's logarithmCoppersmith's algorithmdiscrete logarithm of field elementstable sizeweight-4 polynomials

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (4)

A survey on fast correlation attacks ⋮ A new approach for finding low-weight polynomial multiples ⋮ An analysis and an improvement of iterative fast correlation attacks ⋮ Results on multiples of primitive polynomials and their products over GF(2)

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

This page was built for publication: Computation of low-weight parity checks for correlation attacks on stream ciphers