Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes

DOI10.1007/s11786-009-0015-8zbMath1205.94095WikidataQ62039176 ScholiaQ62039176MaRDI QIDQ626942

Léonard Dallot, Jean-Pierre Tillich, Ayoub Otmani

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-009-0015-8

zbMATH Keywords

BCH codes; quasi-cyclic codes; cryptanalysis; LDPC codes; McEliece cryptosystem

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Code-Based Public-Key Cryptosystems and Their Applications, An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC, Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling, Two classes of quasi-cyclic codes via irreducible polynomials, McEliece-type encryption based on Gabidulin codes with no hidden structure, Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem, Enhanced public key security for the McEliece cryptosystem, On generating invertible circulant binary matrices with a prescribed number of ones, Encryption scheme based on expanded Reed-Solomon codes, Properties of constacyclic codes under the Schur product, Secure Message Authentication Against Related-Key Attack, Monoidic Codes in Cryptography, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Reducing Key Length of the McEliece Cryptosystem

Uses Software

• Magma
• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the concatenated structure of a linear code
• The Magma algebra system. I: The user language
• How to mask the structure of codes for a cryptographic use
• Attacking and Defending the McEliece Cryptosystem
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A public-key cryptosystem based on binary Reed-Muller codes
• On the inherent intractability of certain coding problems (Corresp.)
• On the edge-independence number and edge-covering number for regular graphs
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• A Summary of McEliece-Type Cryptosystems and their Security
• On Kabatianskii-Krouk-Smeets Signatures
• Cryptanalysis of the Sidelnikov Cryptosystem
• Public Key Cryptography - PKC 2006