Syndrome Decoding Estimator
From MaRDI portal
Publication:5087253
DOI10.1007/978-3-030-97121-2_5zbMath1492.94100OpenAlexW4214644294MaRDI QIDQ5087253
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_5
Related Items (6)
Syndrome Decoding Estimator ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ An estimator for the hardness of the MQ problem ⋮ Partial key exposure attacks on BIKE, Rainbow and NTRU ⋮ Hybrid decoding -- classical-quantum trade-offs for information set decoding ⋮ Ternary forking lemma and its application to the analysis of one code-based signature
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- Decoding linear codes with high error rate and its impact for LPN security
- Improved quantum information set decoding
- Quantum information set decoding algorithms
- LPN decoded
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Lower bounds on lattice sieving and information set decoding
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- 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
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Decoding One Out of Many
- Attacking and Defending the McEliece Cryptosystem
- Grover vs. McEliece
- Information-Set Decoding for Linear Codes over F q
- 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
- Syndrome Decoding Estimator
- Smaller Decoding Exponents: Ball-Collision Decoding
This page was built for publication: Syndrome Decoding Estimator
