Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes

DOI10.1007/978-3-030-36237-9_6zbMath1442.81021OpenAlexW2995681020MaRDI QIDQ3294870

Olivier Ruatta, Jean Belo Klamti, Cheikh Thiecoumba Gueye, Thierry P. Berger

Publication date: 29 June 2020

Published in: Algebra, Codes and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-36237-9_6

zbMATH Keywords

quasi-cyclic codesReed-Solomon codessubspace subcodesMcEliece public key cryptosystem

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

Security analysis of a cryptosystem based on subspace subcodes ⋮ On the design and security of Lee metric McEliece cryptosystems

Uses Software

• Magma
• McEliece
• LEDAcrypt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural cryptanalysis of McEliece schemes with compact keys
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• The Magma algebra system. I: The user language
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• A new rank metric codes based encryption scheme
• Gabidulin matrix codes and their application to small ciphertext size cryptosystems
• Codes over $\mathcal{L}(GF(2)^m,GF(2)^m)$, MDS Diffusion Matrices and Cryptographic Applications
• On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Post-Quantum Cryptography
• Attacking and Defending the McEliece Cryptosystem
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Reducing Key Length of the McEliece Cryptosystem
• Security Bounds for the Design of Code-Based Cryptosystems
• Compact McEliece Keys from Goppa Codes
• On the inherent intractability of certain coding problems (Corresp.)
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Subspace subcodes of Reed-Solomon codes
• 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: Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes