Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices

DOI10.1007/978-3-642-25405-5_10zbMath1298.94092OpenAlexW68055459MaRDI QIDQ3102789

Stefan Heyse

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_10

zbMATH Keywords

embedded deviceMcEliece implementationPost-Quantumquasi-dyadic Goppa code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ Toward secure implementation of McEliece decryption ⋮ Secure Message Authentication Against Related-Key Attack ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$

Uses Software

• McEliece
• MicroEliece

Cites Work

• Attacking and Defending the McEliece Cryptosystem
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Low-Reiter: Niederreiter Encryption Scheme for Embedded Microcontrollers
• MicroEliece: McEliece for Embedded Devices
• Compact McEliece Keys from Goppa Codes
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Secure integration of asymmetric and symmetric encryption schemes
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices