List Decoding for Binary Goppa Codes
From MaRDI portal
Publication:3005580
DOI10.1007/978-3-642-20901-7_4zbMath1272.94095OpenAlexW2116941002MaRDI QIDQ3005580
Publication date: 8 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_4
Related Items
ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Attacking and Defending the McEliece Cryptosystem ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ On the dimension of the subfield subcodes of 1-point Hermitian codes ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Wild McEliece ⋮ Parallel-CFS ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Wild McEliece Incognito
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
- Advances in cryptology -- ASIACRYPT 2009. 15th international conference on the theory and application of cryptology and information security, Tokyo, Japan, December 6--10, 2009. Proceedings
- Factoring multivariate polynomials over finite fields
- On lattice reduction for polynomial matrices
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Wild McEliece
- Divisors in Residue Classes
- Attacking and Defending the McEliece Cryptosystem
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
- The algebraic decoding of Goppa codes
- Further results on Goppa codes and their applications to constructing efficient binary codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Divisors in residue classes, constructively
- Finding smooth integers in short intervals using CRT decoding
- Finding smooth integers in short intervals using CRT decoding
