Reducing Key Length of the McEliece Cryptosystem
From MaRDI portal
Recommendations
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Algebraic cryptanalysis of McEliece variants with compact keys
- Enhanced public key security for the McEliece cryptosystem
- Structural cryptanalysis of McEliece schemes with compact keys
- Compact McEliece keys based on quasi-dyadic Srivastava codes
Cites work
- 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 probabilistic algorithm for computing minimum weights of large error-correcting codes
- A public-key cryptosystem based on binary Reed-Muller codes
- A Summary of McEliece-Type Cryptosystems and their Security
- Attacking and Defending the McEliece Cryptosystem
- Cryptanalysis of the Sidelnikov Cryptosystem
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- scientific article; zbMATH DE number 1618037 (Why is no real title available?)
- scientific article; zbMATH DE number 4179278 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- McEliece Cryptosystem Implementation: Theory and Practice
- On Kabatianskii-Krouk-Smeets Signatures
- On the concatenated structure of a linear code
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
Cited in
(53)- Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams
- Variations of the McEliece cryptosystem
- DAGS: key encapsulation using dyadic GS codes
- On the design and security of Lee metric McEliece cryptosystems
- Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes
- Security analysis of a cryptosystem based on subspace subcodes
- Properties of constacyclic codes under the Schur product
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
- Dihedral codes with prescribed minimum distance
- Reproducible families of codes and cryptographic applications
- Reducing the key size of McEliece cryptosystem from automorphism-induced Goppa codes via permutations
- Computational aspects of retrieving a representation of an algebraic geometry code
- Structural cryptanalysis of McEliece schemes with compact keys
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- scientific article; zbMATH DE number 1583808 (Why is no real title available?)
- Enhanced public key security for the McEliece cryptosystem
- A multivariate encryption scheme with Rainbow
- Reducing the key size of rainbow using non-commutative rings
- Weaknesses in two RFID authentication protocols
- Square code attack on a modified Sidelnikov cryptosystem
- Wild McEliece
- 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
- Monoidic codes in cryptography
- Statistical Decoding of Codes over $\mathbb{F}_q$
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- New variant of the McEliece cryptosystem
- Basics of secrecy coding
- Algebraic cryptanalysis of McEliece variants with compact keys
- Compact McEliece keys from Goppa codes
- Code-based public-key cryptosystems and their applications
- Quantum cryptography: key distribution and beyond
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- A NP-complete problem in coding theory with application to code based cryptography
- On checkable codes in group algebras
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Two classes of quasi-cyclic codes via irreducible polynomials
- The syndromes decoding algorithm in group codes
- 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
- A code-based hybrid signcryption scheme
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- The McEliece-type cryptosystem based on D-codes
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Coding properties and automorphism groups of two classes of twisted generalized Reed-Solomon codes
- Non-binary expurgated and extended Goppa codes with dihedral or 4-th alternating automorphism groups
- On quasi-cyclic codes as a generalization of cyclic codes
- Quasi-cyclic binary extended and expurgated Goppa codes and their parameters
- The syndrome weight distribution in quasi-cyclic codes, applications to BIKE and HQC
- Cryptanalysis of a system based on twisted Reed-Solomon codes
This page was built for publication: Reducing Key Length of the McEliece Cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637133)
