Compact McEliece Keys from Goppa Codes

DOI10.1007/978-3-642-05445-7_24zbMath1267.94086DBLPconf/sacrypt/MisoczkiB09OpenAlexW1550367722WikidataQ63131677 ScholiaQ63131677MaRDI QIDQ3651272

Paulo S. L. M. Barreto, Rafael Misoczki

Publication date: 9 December 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-05445-7_24

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ Secure Message Authentication Against Related-Key Attack ⋮ Weaknesses in Two RFID Authentication Protocols ⋮ Square Code Attack on a Modified Sidelnikov Cryptosystem ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ Designing efficient dyadic operations for cryptographic applications ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ A code-based hybrid signcryption scheme ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes ⋮ Reproducible families of codes and cryptographic applications ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ On the dimension of the subfield subcodes of 1-point Hermitian codes ⋮ A modified Dual-Ouroboros public-key encryption using Gabidulin codes ⋮ Counting extended irreducible Goppa codes ⋮ Wild McEliece ⋮ A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem ⋮ Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices ⋮ Monoidic Codes in Cryptography

This page was built for publication: Compact McEliece Keys from Goppa Codes