Algebraic cryptanalysis of McEliece variants with compact keys
From MaRDI portal
Recommendations
- Structural cryptanalysis of McEliece schemes with compact keys
- Reducing Key Length of the McEliece Cryptosystem
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Algebraic attack against variants of McEliece with Goppa polynomial of a special form
- scientific article; zbMATH DE number 1302794
Cited in
(44)- Variations of the McEliece cryptosystem
- DAGS: key encapsulation using dyadic GS codes
- Security analysis of a cryptosystem based on subspace subcodes
- Performance bounds for QC-MDPC codes decoders
- Properties of constacyclic codes under the Schur product
- Dihedral codes with prescribed minimum distance
- Reproducible families of codes and cryptographic applications
- Computational aspects of retrieving a representation of an algebraic geometry code
- Asymptotic behaviour of codes in rank metric over finite fields
- Structural cryptanalysis of McEliece schemes with compact keys
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Differential power analysis of a McEliece cryptosystem
- Cryptanalysis of the McEliece public key cryptosystem based on polar codes
- Algebraic attack against variants of McEliece with Goppa polynomial of a special form
- Square code attack on a modified Sidelnikov cryptosystem
- Wild McEliece
- Parallel-CFS
- A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
- 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
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- The key space of the McEliece–Sidelnikov cryptosystem
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Improved information set decoding for code-based cryptosystems with constrained memory
- Reducing Key Length of the McEliece Cryptosystem
- Weak keys in the McEliece public-key cryptosystem
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- On new problems in asymmetric cryptography based on error-resistant coding
- Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes
- Practical algebraic attack on DAGS
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- On quasi-cyclic codes as a generalization of cyclic codes
- Higher-genus McEliece
- The syndrome weight distribution in quasi-cyclic codes, applications to BIKE and HQC
- Algebraic cryptanalysis of variants of \textsc{Frit}
- Cryptanalysis of a system based on twisted Reed-Solomon codes
This page was built for publication: Algebraic cryptanalysis of McEliece variants with compact keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563840)
