Wild McEliece Incognito

DOI10.1007/978-3-642-25405-5_16zbMath1290.94042OpenAlexW2104256194MaRDI QIDQ3102796

Christiane Peters, Tanja Lange, Daniel J. Bernstein

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_16

zbMATH Keywords

Goppa codesMcEliece cryptosystemNiederreiter cryptosystemlist decodingwild Goppa codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Decoding (94B35)

Related Items (4)

Enhanced public key security for the McEliece cryptosystem ⋮ Totally decomposed cumulative Goppa codes with improved estimations ⋮ New identities relating wild Goppa codes ⋮ Computer algebra tales on Goppa codes and McEliece cryptography

Uses Software

• SageMath
• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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. Third international workshop, PQCrypto 2010, Darmstadt, Germany, May 25--28, 2010. Proceedings
• How to mask the structure of codes for a cryptographic use
• List Decoding for Binary Goppa Codes
• Wild McEliece
• Simplified High-Speed High-Distance List Decoding for Alternant Codes
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
• Information-Set Decoding for Linear Codes over F q
• The algebraic decoding of Goppa codes
• Further results on Goppa codes and their applications to constructing efficient binary codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm

This page was built for publication: Wild McEliece Incognito