A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes

DOI10.1007/978-3-540-85855-3_17zbMath1180.94046arXiv1109.5827OpenAlexW2150802958WikidataQ125019244 ScholiaQ125019244MaRDI QIDQ3540050

Marco Bodrato, Marco Baldi, Franco Chiaraluce

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.5827

zbMATH Keywords

cryptanalysisMcEliece cryptosystemWinogradToom-CookQC-LDPC codes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (15)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ Enhanced public key security for the McEliece cryptosystem ⋮ Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes ⋮ Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes ⋮ Reproducible families of codes and cryptographic applications ⋮ On generating invertible circulant binary matrices with a prescribed number of ones ⋮ Encryption scheme based on expanded Reed-Solomon codes ⋮ An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC ⋮ QC-LDPC ⋮ Cryptanalysis of LEDAcrypt

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• On arithmetical algorithms over finite fields
• Fast multiplication of polynomials over fields of characteristic 2
• An algorithm for exact division
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• On the inherent intractability of certain coding problems (Corresp.)
• 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
• The capacity of low-density parity-check codes under message-passing decoding
• Efficient encoding of low-density parity-check codes
• Faster Multiplication in GF(2)[x]
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0

This page was built for publication: A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes