Structural cryptanalysis of McEliece schemes with compact keys
From MaRDI portal
Publication:264131
DOI10.1007/s10623-015-0036-zzbMath1361.94039OpenAlexW2050547564WikidataQ62039155 ScholiaQ62039155MaRDI QIDQ264131
Frédéric de Portzamparc, Ludovic Perret, Ayoub Otmani, Jean-Pierre Tillich, Jean-Charles Faugère
Publication date: 5 April 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00964265/file/210.pdf
Related Items (10)
Security analysis of a cryptosystem based on subspace subcodes ⋮ Square Code Attack on a Modified Sidelnikov Cryptosystem ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ Differential Power Analysis of a McEliece Cryptosystem ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- Goppa and related codes invariant under a prescribed permutation
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
- Quasi-Dyadic CFS Signatures
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices
- Monoidic Codes in Cryptography
- Attacking and Defending the McEliece Cryptosystem
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- On Ideal Lattices and Learning with Errors over Rings
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Information-Set Decoding for Linear Codes over F q
- Reducing Key Length of the McEliece Cryptosystem
- Security Bounds for the Design of Code-Based Cryptosystems
- Efficient Public Key Encryption Based on Ideal Lattices
- Compact McEliece Keys from Goppa Codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- The algebraic decoding of Goppa codes
- 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
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Weak keys in the McEliece public-key cryptosystem
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- Smaller Decoding Exponents: Ball-Collision Decoding
- A Distinguisher for High-Rate McEliece Cryptosystems
- FGb: A Library for Computing Gröbner Bases
This page was built for publication: Structural cryptanalysis of McEliece schemes with compact keys
