Reproducible families of codes and cryptographic applications

DOI10.1515/JMC-2020-0003MaRDI QIDQ2239799zbMATH OpenOpenAlexWikidataFDO

Authors Edoardo Persichetti, Marco Baldi, P. M. Santini

Publication date 5 November 2021

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/jmc-2020-0003

zbMATH Keywords

code-based cryptographypost-quantum cryptographylinear block codesreproducible codes

Mathematics Subject Classification ID

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

Recommendations

• Structural cryptanalysis of McEliece schemes with compact keys
• Monoidic codes in cryptography
• Reducible rank codes and their applications to cryptography
• scientific article; zbMATH DE number 2154506
• QC-LDPC code-based cryptography

Cites work

• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• A framework for cryptographic problems from linear algebra
• A key recovery attack on MDPC with CCA security using decoding errors
• A modular analysis of the Fujisaki-Okamoto transformation
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A reaction attack on the QC-LDPC McEliece cryptosystem
• Algebraic cryptanalysis of McEliece variants with compact keys
• An efficient structural attack on NIST submission DAGS
• Analysis of information set decoding for a sub-linear error weight
• CAKE: CODE-based algorithm for key encapsulation
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• Compact McEliece keys from Goppa codes
• DAGS: key encapsulation using dyadic GS codes
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding one out of many
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Designing efficient dyadic operations for cryptographic applications
• Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes
• Grover vs. McEliece
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• On the edge-independence number and edge-covering number for regular graphs
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• QC-MDPC: a timing attack and a CCA2 KEM
• Reducing Key Length of the McEliece Cryptosystem
• Unitary Triangularization of a Nonsymmetric Matrix

Cited in

(3)

• scientific article; zbMATH DE number 2154506 (Why is no real title available?)
• Codes based on dyadic matrices and their generalizations
• Recursive constructions of secure codes and hash families using difference function families.

Describes a project that uses

Uses Software

• BIKE
• LEDAkem
• CAKE
• McEliece

This page was built for publication: Reproducible families of codes and cryptographic applications

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