Quantum resistant random linear code based public key encryption scheme RLCE

@article{Wang2016QuantumRR,
  title={Quantum resistant random linear code based public key encryption scheme RLCE},
  author={Yongge Wang},
  journal={2016 IEEE International Symposium on Information Theory (ISIT)},
  year={2016},
  pages={2519-2523}
}
  • Yongge Wang
  • Published 28 December 2015
  • Computer Science, Mathematics
  • 2016 IEEE International Symposium on Information Theory (ISIT)
Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction algorithm has been one of the major cryptanalysis techniques for lattice based cryptographic systems, key recovery cryptanalysis techniques for linear code based cryptographic systems are generally scheme specific. In recent years, several important techniques such as… 

Tables from this paper

Revised Quantum Resistant Public Key Encryption Scheme RLCE and IND-CCA2 Security for McEliece Schemes
  • Yongge Wang
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2017
TLDR
It is shown that RLCE schemes have smaller public key sizes compared to binary Goppa code based McEliece encryption schemes for corresponding security levels, and message padding schemes for RLCE to achieve IND-CCA2 security.
Survey on cryptanalysis of code-based cryptography: From theoretical to physical attacks
TLDR
Some background on coding theory is proposed in order to present some of the main flawless in the protocols and analyze the existing side-channel attacks and give some recommendations on how to securely implement the most suitable variants.
Quantum Resistant Public Key Encryption Scheme polarRLCE
TLDR
It is shown that, with the proper choice of parameters, using polar codes, it is possible to design an encryption scheme to achieve the intended security level while keeping a reasonably small key size, especially on the high-security level.
An IND-CCA2 secure post-quantum encryption scheme and a secure cloud storage use case
TLDR
A new code-based PKE scheme is obtained from Lau and Tan's scheme, in order to inherit the underlying small public key and ciphertext sizes, and is shown to achieve IND-CCA2 security, instead of the weaker IND-CPA security.
A Cryptographic System Based on a New Class of Binary Error-Correcting Codes
TLDR
A new cryptographic system based on the idea of encryption due to the McEliece encryption system with a new linear error-correcting code is introduced, which is a promising post-quantum candidate.
Quantum Resistant Public Key Encryption Scheme HermitianRLCE
TLDR
These parameters show that HermitianRLCE has much smaller public keys than GRS-RLCE, and based on the security analysis, this paper provides hermitian code based RLCE parameters at the 128, 192, and 256 bits security level.
Sécurité de Protocoles Cryptographiques Fondés sur la Théorie des Codes Correcteurs d'Erreurs . (Security of cryptographic protocols based on coding theory)
TLDR
It is proved that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. is vulnerable to a polynomial-time attack that recovers the private key by applying Overbeck’s attack on an appropriate public code.
polarRLCE: A New Code-Based Cryptosystem Using Polar Codes
TLDR
It is shown that the first efficient secure scheme based on polar codes (i.e., polarRLCE) which is inspired by the RLCE scheme, a candidate for the NIST postquantum cryptography standardization in the first round, enjoys an apparent advantage to decrease the public key size, especially on the high-security level.
Code Structures for Quantum Encryption and Decryption
  • E. Sakk, S. Wang
  • Computer Science
    2021 IEEE 5th International Conference on Cryptography, Security and Privacy (CSP)
  • 2021
TLDR
This work demonstrates a quantum approach to data encryption and decryption based upon the McEliece cryptosystem using Reed-Muller codes and discusses alternative operator factorizations for the proposed cryptos system.
Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QC-MDPC Codes
TLDR
This letter presents a cryptanalysis of the modified McEliece cryptosystem recently proposed by Moufek et al., and shows that the probability of weak keys is high enough that this variant can be ruled out as a possible secure encryption scheme.
...
...

References

SHOWING 1-10 OF 77 REFERENCES
Error-correcting pairs for a public-key cryptosystem
TLDR
The class of codes with a t-ECP is proposed for the McEliece cryptosystem and the hardness of distinguishing arbitrary codes from those having a t -error correcting pair is studied.
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
TLDR
It is proved that the private key of the McEliece cryptosystem satisfies a system of bi-homogeneous polynomial equations, which is due to the particular class of codes considered which are alternant codes.
Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
TLDR
An alternative to Sidelnikov and Shestakov attack is given by building a filtration which enables to completely recover the support and the non-zero scalars defining the secret generalized Reed–Solomon code.
Selecting parameters for secure McEliece-based cryptosystems
TLDR
This paper solves the problem of selecting optimal parameters for the McEliece cryptosystem that are expected to provide security at least until a given year and gives detailed recommendations.
Reducing Key Length of the McEliece Cryptosystem
TLDR
The result suggests that decoding attack against the variant has little chance to be better than the general one against the classical McEliece cryptosystem, and a new NP-complete decision problem called quasi-cyclic syndrome decoding is introduced.
An Observation on the Security of McEliece's Public-Key Cryptosystem
TLDR
A systematic method of checking is suggested, and a generalized version of the cryptanalytic attack which reduces the work factor sigdicantly is described, which can be viewed as generalized probabilistic decoding algorithms for any linear error correcting codes.
On insecurity of cryptosystems based on generalized Reed-Solomon codes
TLDR
A method of finding the unknown matrices H, 2t which determines the matrix 93 in O(s + sN) arithmetical operations in F7 is suggested which proves the insecurity of public-key cryptosystems based on code-theoretic constructions.
Information-Set Decoding for Linear Codes over Fq
TLDR
This paper presents a generalization of Stern's information-set- decoding algorithm for decoding linear codes over arbitrary finite fields Fq and analyzes the complexity to make it possible to compute the security of recently proposed code-based systems over non-binary fields.
A Distinguisher for High-Rate McEliece Cryptosystems
TLDR
This work presents the first method allowing to distinguish alternant and Goppa codes over any field, and can solve the GD problem in polynomial time provided that the codes have sufficiently large rates.
Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography
  • Christian Wieschebrink
  • Computer Science, Mathematics
    2006 IEEE International Symposium on Information Theory
  • 2006
TLDR
It is shown that the reconstruction of a punctured code from a given code is an NP-complete problem, and a modification of code-based cryptosystems such as the Niederreiter scheme is suggested that is resistant to the Sidelnikov-Shestakov attack.
...
...