Monoidic Codes in Cryptography

DOI10.1007/978-3-642-25405-5_12zbMath1298.94078OpenAlexW2951786898MaRDI QIDQ3102791

Richard Lindner, Rafael Misoczki, Paulo S. L. M. Barreto

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_12

zbMATH Keywords

codesefficient algorithmspost-quantum cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

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 ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ A code-based hybrid signcryption scheme ⋮ 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$$

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• Quasi-Dyadic CFS Signatures
• Wild McEliece
• Parallel-CFS
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Information-Set Decoding for Linear Codes over F q
• Reducing Key Length of the McEliece Cryptosystem
• Security Bounds for the Design of Code-Based Cryptosystems
• Compact McEliece Keys from Goppa Codes
• On extending Goppa codes to cyclic codes (Corresp.)
• On the edge-independence number and edge-covering number for regular graphs
• Smaller Decoding Exponents: Ball-Collision Decoding