Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension

DOI10.1007/S10623-015-0099-XMaRDI QIDQ310244zbMATH OpenOpenAlexFDO

Authors Carl Löndahl, Thomas Johansson, Masoumeh Koochak Shooshtari, Mahmoud Ahmadian-Attari, M. R. Aref

Publication date 8 September 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-015-0099-x

zbMATH Keywords

public-key cryptographyinformation-set decodinglow-weight codewordMcElieceMDPC codes

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Recommendations

• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• Reducing Key Length of the McEliece Cryptosystem
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Algebraic cryptanalysis of McEliece variants with compact keys
• Structural cryptanalysis of McEliece schemes with compact keys

Cites work

• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Algebraic cryptanalysis of McEliece variants with compact keys
• Attacking and Defending the McEliece Cryptosystem
• 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})\)
• Hardness of approximating the minimum distance of a linear code
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
• On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes
• On the edge-independence number and edge-covering number for regular graphs
• Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices

Cited in

(10)

• Structural cryptanalysis of McEliece schemes with compact keys
• Performance bounds for QC-MDPC codes decoders
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• Polynomial time attack on wild McEliece over quadratic extensions
• Efficient error-correcting codes for the HQC post-quantum cryptosystem
• A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
• Cryptanalysis of LEDAcrypt
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• \textsf{FuLeeca}: a Lee-based signature scheme
• On generating invertible circulant binary matrices with a prescribed number of ones

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension

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