Syndrome Decoding Estimator
From MaRDI portal
Publication:5087253
DOI10.1007/978-3-030-97121-2_5zbMATH Open1492.94100OpenAlexW4214644294MaRDI QIDQ5087253FDOQ5087253
Authors: Andre Esser, Emanuele Bellini 
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
Recommendations
- Syndrome-decoding algorithms for static-diagnosis models
- An algorithm for generalized syndrome decoding problem
- A new identification scheme based on syndrome decoding
- scientific article
- Syndrome decoding of binary-rate<tex>k/n</tex>convolutional codes
- Decoding of convolutional codes using a syndrome trellis
- The syndromes decoding algorithm in group codes
- Statistical Decoding Revisited
- Reliability-based syndrome decoding of linear block codes
Cites Work
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- Title not available (Why is that?)
- 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
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Security bounds for the design of code-based cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Smaller decoding exponents: ball-collision decoding
- Title not available (Why is that?)
- Decoding one out of many
- Grover vs. McEliece
- Decoding linear codes with high error rate and its impact for LPN security
- LPN decoded
- Analysis of information set decoding for a sub-linear error weight
- On computing nearest neighbors with applications to decoding of binary linear codes
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Lower bounds on lattice sieving and information set decoding
- Improved quantum information set decoding
- Quantum information set decoding algorithms
- Syndrome Decoding Estimator
Cited In (13)
- Syndrome Decoding Estimator
- The hardness of LPN over any integer ring and field for PCG applications
- Hybrid decoding -- classical-quantum trade-offs for information set decoding
- Ternary forking lemma and its application to the analysis of one code-based signature
- Revisiting nearest-neighbor-based information set decoding
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- Integer syndrome decoding in the presence of noise
- CryptAttackTester: high-assurance attack analysis
- An estimator for the hardness of the MQ problem
- Partial key exposure attacks on BIKE, Rainbow and NTRU
- Memory-efficient quantum information set decoding algorithm
Uses Software
This page was built for publication: Syndrome Decoding Estimator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087253)
