Square Code Attack on a Modified Sidelnikov Cryptosystem
From MaRDI portal
Publication:2947081
DOI10.1007/978-3-319-18681-8_14zbMath1441.94091OpenAlexW2260899646WikidataQ62039161 ScholiaQ62039161MaRDI QIDQ2947081
Ayoub Otmani, Hervé Talé Kalachi
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18681-8_14
Related Items (6)
Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial ⋮ Quantum Resistant Public Key Encryption Scheme polarRLCE ⋮ Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes ⋮ On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
Cites Work
- Unnamed Item
- Unnamed Item
- Structural cryptanalysis of McEliece schemes with compact keys
- A characterization of MDS codes that have an error correcting pair
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- How to mask the structure of codes for a cryptographic use
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Reducing Key Length of the McEliece Cryptosystem
- Compact McEliece Keys from Goppa Codes
- A public-key cryptosystem based on binary Reed-Muller codes
- On the edge-independence number and edge-covering number for regular graphs
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A Distinguisher for High-Rate McEliece Cryptosystems
- Cryptanalysis of the Sidelnikov Cryptosystem
This page was built for publication: Square Code Attack on a Modified Sidelnikov Cryptosystem
