Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
| Autor: | Jean Belo Klamti, Thierry P. Berger, Cheikh Thiecoumba Gueye, Olivier Ruatta |
|---|---|
| Přispěvatelé: | Laboratoire de Thermique, Ecoulements Mécaniques matériaux mise en forme PrOduction (TEMPO), Université de Valenciennes et du Hainaut-Cambrésis (UVHC), Université Cheikh Anta Diop [Dakar, Sénégal] (UCAD), Mathématiques & Sécurité de l'information (XLIM-MATHIS), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Cyclic subspace Theoretical computer science Computer science business.industry [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Coding theory 01 natural sciences Public-key cryptography [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] 010201 computation theory & mathematics Reed–Solomon error correction [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT] [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 0202 electrical engineering electronic engineering information engineering Code (cryptography) Cryptosystem Hardware_ARITHMETICANDLOGICSTRUCTURES business Subspace topology ComputingMilieux_MISCELLANEOUS Key size |
| Zdroj: | Algebra, Codes and Cryptology Algebra, Codes and Cryptology, pp.97-113, 2019, ⟨10.1007/978-3-030-36237-9_6⟩ Algebra, Codes and Cryptology ISBN: 9783030362362 |
| DOI: | 10.1007/978-3-030-36237-9_6⟩ |
| Popis: | In this paper we introduce a code-based cryptosystem using quasi-cyclic generalized subspace subcodes of Generalized Reed-Solomon codes in order to reduce the public key size. In our scheme the underlying Generalized Reed-Solomon code is not secret, so the classical attacks such as square code or folding attacks have no more purpose against it. In addition one part of the security of this scheme is based on hard problems in coding theory like Equivalence Subcodes (ES) Problem. We propose some parameters to reach at least a security level of 128 and 192 bits. We make a public key size comparison with some well established code-based public key encryption schemes. We also see that for the 128 bits security level the key size of our proposals are often better than the code-based schemes in competition for NIST’s second round. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|