Compact McEliece keys based on quasi-dyadic Srivastava codes

DOI10.1515/jmc-2011-0099zbMath1277.94037OpenAlexW2017429418MaRDI QIDQ4650077

Edoardo Persichetti

Publication date: 23 November 2012

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2011-0099

zbMATH Keywords

McEliece cryptosystempost-quantum cryptographyMcEliece keysquasi-dyadic Srivastava codesshort public keys

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60)

Related Items (17)

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 ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Designing efficient dyadic operations for cryptographic applications ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ Automating the functional correspondence between higher-order evaluators and abstract machines ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ The syndromes decoding algorithm in group codes ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ A code-based hybrid signcryption scheme ⋮ Cryptanalysis of a code-based full-time signature ⋮ 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$$ ⋮ Generic authenticated key exchange in the quantum random oracle model ⋮ Computer algebra tales on Goppa codes and McEliece cryptography

This page was built for publication: Compact McEliece keys based on quasi-dyadic Srivastava codes