Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications

DOI10.1007/s10623-014-9960-6zbMath1335.11098OpenAlexW1799907457MaRDI QIDQ398976

Thomas Johansson, Carl Löndahl

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-014-9960-6

zbMATH Keywords

public-key cryptographycorrelation attacksinformation-set decodinglow-weight codeword\(\mathrm{TCH}_{\mathrm O}\)low-weight polynomial multiple

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06) Randomized algorithms (68W20)

Related Items

Walsh transforms and cryptographic applications in bias computing ⋮ Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension ⋮ A new approach for finding low-weight polynomial multiples ⋮ Finding low-weight polynomial multiples using the rho method ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast correlation attacks on certain stream ciphers
• A survey on fast correlation attacks
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Attacking and Defending the McEliece Cryptosystem
• $\mathcal{TCH}o$ : A Hardware-Oriented Trapdoor Cipher
• Introduction to post-quantum cryptography
• A Practical Key Recovery Attack on Basic TCHo
• Security Bounds for the Design of Code-Based Cryptosystems
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Algorithmic Cryptanalysis
• Smaller Decoding Exponents: Ball-Collision Decoding
• When Stream Cipher Analysis Meets Public-Key Cryptography

This page was built for publication: Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications