Code-Based Cryptosystems Using Generalized Concatenated Codes
From MaRDI portal
Publication:4610024
DOI10.1007/978-3-319-56932-1_26zbMath1384.94097arXiv1511.08413OpenAlexW2963423338MaRDI QIDQ4610024
Sven Puchinger, Sven Müelich, Karim Ishak, Martin Bossert
Publication date: 5 April 2018
Published in: Applications of Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08413
McEliece cryptosystempost-quantum cryptographygeneralized concatenated codescode-based cryptosystems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concatenated structures of a [49,18,12 binary abelian code]
- On the concatenated structure of a linear code
- McEliece public key cryptosystems using algebraic-geometric codes
- How to mask the structure of codes for a cryptographic use
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Information-Set Decoding for Linear Codes over F q
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A public-key cryptosystem based on binary Reed-Muller codes
- New directions in cryptography
- The complexity of information set decoding
- A method for obtaining digital signatures and public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- Matrix Representation of Finite Fields
- Cryptanalysis of the Sidelnikov Cryptosystem
- Class of constructive asymptotically good algebraic codes
This page was built for publication: Code-Based Cryptosystems Using Generalized Concatenated Codes
