Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE

TL;DR

This paper introduces RLCE, a linear code-based encryption scheme designed to be resistant to known cryptanalysis techniques, aiming to provide a post-quantum secure alternative similar in security to random linear codes.

Contribution

The paper proposes the RLCE encryption scheme based on random linear codes, demonstrating its security against existing cryptanalysis methods and aligning its security with the hardness of decoding random linear codes.

Findings

RLCE resists current cryptanalysis techniques.

Security levels are adjustable with recommended parameters.

Scheme's security is comparable to decoding random linear codes.

Abstract

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.