Structural cryptanalysis of McEliece schemes with compact keys
From MaRDI portal
Publication:264131
DOI10.1007/S10623-015-0036-ZzbMATH Open1361.94039OpenAlexW2050547564WikidataQ62039155 ScholiaQ62039155MaRDI QIDQ264131FDOQ264131
Authors: Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich 
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
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- FGb: A Library for Computing Gröbner Bases
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- On ideal lattices and learning with errors over rings
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- 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
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- 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})\)
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices
- Monoidic codes in cryptography
- Attacking and Defending the McEliece Cryptosystem
- Algebraic cryptanalysis of McEliece variants with compact keys
- Information-set decoding for linear codes over \(\mathbb 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 (extended abstract)
- Compact McEliece keys from Goppa codes
- Title not available (Why is that?)
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Title not available (Why is that?)
- The algebraic decoding of Goppa codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Smaller decoding exponents: ball-collision decoding
- A Distinguisher for High-Rate McEliece Cryptosystems
- Title not available (Why is that?)
- 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
Cited In (29)
- Computational aspects of retrieving a representation of an algebraic geometry code
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Algebraic attack against variants of McEliece with Goppa polynomial of a special form
- Critical attacks in code-based cryptography
- Differential power analysis of a McEliece cryptosystem
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Cryptanalysis of McEliece’s Public-Key Cryptosystem
- Weak keys for the quasi-cyclic MDPC public key encryption scheme
- Two modifications for Loidreau's code-based cryptosystem
- Compact McEliece keys from Goppa codes
- Algebraic cryptanalysis of McEliece variants with compact keys
- Cryptanalysis of schemes based on pseudoinverse matrix
- 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
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Square code attack on a modified Sidelnikov cryptosystem
- Security analysis of a cryptosystem based on subspace subcodes
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- Code-based public-key cryptosystems and their applications
- Reducing Key Length of the McEliece Cryptosystem
- DAGS: key encapsulation using dyadic GS codes
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- The key space of the McEliece–Sidelnikov cryptosystem
- Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes
- Vulnerabilities of ``McEliece in the world of Escher
- Hardness estimates of the code equivalence problem in the rank metric
Uses Software
This page was built for publication: Structural cryptanalysis of McEliece schemes with compact keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264131)
