Simplified High-Speed High-Distance List Decoding for Alternant Codes
From MaRDI portal
Publication:3102792
DOI10.1007/978-3-642-25405-5_13zbMath1298.94140OpenAlexW1483957515MaRDI QIDQ3102792
Publication date: 25 November 2011
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25405-5_13
Related Items
Computing minimal interpolation bases ⋮ Wild McEliece Incognito ⋮ Formally verified certificate checkers for hardest-to-round computation
Uses Software
Cites Work
- Coding and cryptology. Third international workshop, IWCC 2011, Qingdao, China, May 30 -- June 3, 2011. Proceedings
- Selected areas in cryptography. 17th international workshop, SAC 2010, Waterloo, Ontario, Canada, August 12--13, 2010. Revised selected papers
- Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- Decoding of Reed Solomon codes beyond the error-correction bound
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Advances in cryptology -- EUROCRYPT '96. International conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12-16, 1996. Proceedings
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- On Hensel factorization. I
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- List Decoding for Binary Goppa Codes
- Wild McEliece
- Polynomial Codes Over Certain Finite Fields
- On a class of error correcting binary group codes
- Attacking and Defending the McEliece Cryptosystem
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
- Solving Simultaneous Modular Equations of Low Degree
- Algebraic generalization of BCH-Goppa-Helgert codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Alternant codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Further results on Goppa codes and their applications to constructing efficient binary codes
- On the complexity of decoding Goppa codes (Corresp.)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient Interpolation in the Guruswami–Sudan Algorithm
- Decoding Square-Free Goppa Codes Over $\BBF_{p}$
- A Class of Error-Correcting Codes in $p^m $ Symbols
- Finding smooth integers in short intervals using CRT decoding
- Finding smooth integers in short intervals using CRT decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
