Reproducible families of codes and cryptographic applications

DOI10.1515/JMC-2020-0003zbMATH Open1476.94043OpenAlexW3198948488WikidataQ114845837 ScholiaQ114845837MaRDI QIDQ2239799FDOQ2239799

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

Publication date: 5 November 2021

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

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

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

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)

Cites Work

• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• CAKE: CODE-based algorithm for key encapsulation
• Unitary Triangularization of a Nonsymmetric Matrix
• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Algebraic cryptanalysis of McEliece variants with compact keys
• Reducing Key Length of the McEliece Cryptosystem
• Compact McEliece keys from Goppa codes
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Title not available (Why is that?)
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• On the inherent intractability of certain coding problems (Corresp.)
• On the edge-independence number and edge-covering number for regular graphs
• Decoding One Out of Many
• Grover vs. McEliece
• Title not available (Why is that?)
• A framework for cryptographic problems from linear algebra
• An efficient structural attack on NIST submission DAGS
• DAGS: key encapsulation using dyadic GS codes
• A modular analysis of the Fujisaki-Okamoto transformation
• Analysis of Information Set Decoding for a Sub-linear Error Weight
• A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
• QC-MDPC: a timing attack and a CCA2 KEM
• A reaction attack on the QC-LDPC McEliece cryptosystem
• Designing efficient dyadic operations for cryptographic applications
• Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes

Cited In (2)

• Title not available (Why is that?)
• Recursive constructions of secure codes and hash families using difference function families.

Uses Software

• McEliece
• CAKE
• LEDAkem
• BIKE

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)