A new approach for finding low-weight polynomial multiples
From MaRDI portal
Publication:2151296
DOI10.1007/978-3-030-88323-2_8zbMath1492.94096OpenAlexW3211249355MaRDI QIDQ2151296
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88323-2_8
knapsacklow-weight polynomial multiplecollision-finding algorithmstream cipher cryptanalysistime-memory trade-off
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications]
- Fast correlation attacks on certain stream ciphers
- Factoring polynomials with rational coefficients
- Parallel collision search with cryptanalytic applications
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Polynomial and normal bases for finite fields
- A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
- Mathematics of Public Key Cryptography
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Improved Generic Algorithms for Hard Knapsacks
- An improved Monte Carlo factorization algorithm
- 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
- Computation of low-weight parity checks for correlation attacks on stream ciphers
- Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
- Advances in Cryptology – CRYPTO 2004
This page was built for publication: A new approach for finding low-weight polynomial multiples
