Finding low-weight polynomial multiples using the rho method

DOI10.1007/978-3-031-17433-9_24MaRDI QIDQ6103104zbMATH OpenFDO

Authors Laila El Aimani

Publication date 2 June 2023

Published in Progress in Cryptology - AFRICACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17433-9_24

zbMATH Keywords

(nested) rho algorithmcollision-finding algorithmlow-weight polynomial multipletime/memory trade-off

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Cryptography (94A60)

Recommendations

• A new approach for finding low-weight polynomial multiples
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
• A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Computation of low-weight parity checks for correlation attacks on stream ciphers

Cites work

• A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
• 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
• A new approach for finding low-weight polynomial multiples
• An improved Monte Carlo factorization algorithm
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Fast correlation attacks on certain stream ciphers
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 2086708 (Why is no real title available?)
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
• Improved fast correlation attacts using parity-check equations of weight 4 and 5
• Improved Generic Algorithms for Hard Knapsacks
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Mathematics of public key cryptography.
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• On computing nearest neighbors with applications to decoding of binary linear codes
• Parallel collision search with cryptanalytic applications
• Polynomial and normal bases for finite fields
• Tutorial on large deviations for the binomial distribution
• When Stream Cipher Analysis Meets Public-Key Cryptography

Cited in

(2)

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

This page was built for publication: Finding low-weight polynomial multiples using the rho method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103104)