McEliece Cryptosystem Implementation: Theory and Practice

DOI10.1007/978-3-540-88403-3_4zbMath1177.94131OpenAlexW1506139516MaRDI QIDQ3535350

Bhaskar Biswas, Nicolas Sendrier

Publication date: 11 November 2008

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88403-3_4

zbMATH Keywords

code-based cryptographypublic-key cryptosystemMcEliece encryption schemecryptographic implementation

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (6)

A pseudorandom number generator based on worst-case lattice problems ⋮ ON SOME CRYPTOSYSTEMS BASED ON ALGEBRAIC CODES ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Post-Quantum Cryptography: State of the Art ⋮ Parallel-CFS ⋮ Reducing Key Length of the McEliece Cryptosystem

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algebraic decoding of Goppa codes
• On the inherent intractability of certain coding problems (Corresp.)
• Factoring polynomials using binary representations of finite fields
• 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
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Factoring Polynomials Over Large Finite Fields
• Enumerative source encoding

This page was built for publication: McEliece Cryptosystem Implementation: Theory and Practice