Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE
This work addresses the need for secure post-quantum encryption schemes for cryptographic applications, though it appears incremental as it builds on existing linear code based methods.
The paper tackles the vulnerability of linear code based encryption schemes to recent cryptanalysis attacks by proposing a new scheme called RLCE, which is designed to be secure against existing attacks and aims to achieve security equivalent to decoding random linear codes, with example parameters provided for different security levels.
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 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 linear 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 and we hope that the security of the RLCE scheme is equivalent to the hardness of decoding random linear codes. Example parameters for different security levels are recommended for the scheme RLCE.