Monoidic codes in cryptography

DOI10.1007/978-3-642-25405-5_12MaRDI QIDQ3102791zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• On quaternary Goppa codes
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• QC-LDPC code-based cryptography
• Structural properties of self-dual monomial codes with application to code-based cryptography
• Reducing Key Length of the McEliece Cryptosystem

Cites work

• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• Algebraic cryptanalysis of McEliece variants with compact keys
• Compact McEliece keys from Goppa codes
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• Information-set decoding for linear codes over F_q
• On extending Goppa codes to cyclic codes (Corresp.)
• On the edge-independence number and edge-covering number for regular graphs
• Parallel-CFS
• Quasi-dyadic CFS signatures
• Reducing Key Length of the McEliece Cryptosystem
• Security bounds for the design of code-based cryptosystems
• Smaller decoding exponents: ball-collision decoding
• Wild McEliece

Cited in

(15)

• Structural cryptanalysis of McEliece schemes with compact keys
• Codes based on dyadic matrices and their generalizations
• Reproducible families of codes and cryptographic applications
• Non-binary expurgated and extended Goppa codes with dihedral or 4-th alternating automorphism groups
• Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
• A new approach based on quadratic forms to attack the McEliece cryptosystem
• Structural properties of self-dual monomial codes with application to code-based cryptography
• Two classes of quasi-cyclic codes via irreducible polynomials
• 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
• A code-based hybrid signcryption scheme
• DAGS: key encapsulation using dyadic GS codes
• Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory
• Asymmetric Cryptography with a Hidden Monomial

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: Monoidic codes in cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102791)