International Association
for Cryptologic Research

As potential post-quantum cryptographic schemes, lattice based encryption schemes

and linear codes based encryption schemes

have received extensive attention in recent years.

Though LLL reduction algorithm has been one of the major cryptanalysis techniques

for lattice based cryptographic systems, cryptanalysis techniques for linear codes

based cryptographic systems are generally scheme specific. In recent years,

several important techniques such as

Sidelnikov-Shestakov attack and filtration attacks have been

developed to crypt-analyze linear codes 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 these techniques. Thus it is important to systematically investigate and

design linear code based cryptographic systems that are immune against these attacks.

This paper proposes linear code based encryption schemes RLCE which share

many characteristics with random linear codes. Our analysis shows

that the scheme RLCE is secure against existing attacks and we expect that

the security of the RLCE scheme is equivalent to the hardness of decoding random linear codes.