Paper 2015/298

Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE

Yongge Wang


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 sys- tems are generally scheme specific. In recent years, several important techniques such as Sidelnikov- Shestakov attack, filtration attacks, and algebraic attacks have been developed to crypt-analyze linear code based encryption schemes. Though most of these cryptanalysis techniques are relatively new, they prove to be very powerful and many systems have been broken using them. Thus it is important to design linear code based cryptographic systems that are immune against these attacks. This paper proposes lin- ear code based encryption scheme RLCE which shares many characteristics with random linear codes. Our analysis shows that the scheme RLCE is secure against existing attacks. Example parameters for different security levels are recommended for the scheme RLCE

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
linear code based public cryptography
Contact author(s)
yonwang @ uncc edu
2016-01-15: last of 8 revisions
2015-04-01: received
See all versions
Short URL
Creative Commons Attribution


      author = {Yongge Wang},
      title = {Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE},
      howpublished = {Cryptology ePrint Archive, Paper 2015/298},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.