Security analysis of a cryptosystem based on subspace subcodes
From MaRDI portal
Publication:2163762
DOI10.1007/978-3-030-98365-9_3zbMath1494.94035OpenAlexW4226046732MaRDI QIDQ2163762
Olivier Ruatta, Thierry P. Berger, Jean Belo Klamti, Edoardo Persichetti, M. Anwarul Hasan, Anta Niane Gueye, Cheikh Thiecoumba Gueye, Tovohery Hajatiana Randrianarisoa
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-98365-9_3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Structural cryptanalysis of McEliece schemes with compact keys
- Attacks and counter-attacks on the GPT public key cryptosystem
- Some remarks on the security of the identification scheme based on permuted kernels
- An efficient structural attack on NIST submission DAGS
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- CAKE: CODE-based algorithm for key encapsulation
- DAGS: key encapsulation using dyadic GS codes
- Encryption scheme based on expanded Reed-Solomon codes
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Structural attacks for public key cryptosystems based on Gabidulin codes
- How to mask the structure of codes for a cryptographic use
- Codes over $\mathcal{L}(GF(2)^m,GF(2)^m)$, MDS Diffusion Matrices and Cryptographic Applications
- Monoidic Codes in Cryptography
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Fundamentals of Error-Correcting Codes
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Designing a Rank Metric Based McEliece Cryptosystem
- Reducing Key Length of the McEliece Cryptosystem
- Compact McEliece Keys from Goppa Codes
- On the inherent intractability of certain coding problems (Corresp.)
- On the edge-independence number and edge-covering number for regular graphs
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- On the Security of Subspace Subcodes of Reed–Solomon Codes for Public Key Encryption
- Generalized Subspace Subcodes With Application in Cryptology
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
This page was built for publication: Security analysis of a cryptosystem based on subspace subcodes
