International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 20 November 2015

Yongge Wang
ePrint Report ePrint Report
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 schemes RLCE and bRLCE which share many characteristics with random linear codes. Our analysis shows that the schemes RLCE and bRLCE are secure against existing attacks and we hope that the security of the RLCE/bRLCE schemes is equivalent to the hardness of decoding random linear codes. Example parameters for different security levels are recommended for the schemes RLCE and bRLCE. It is expected that the scheme RLCE with Reed-Solomon code has smaller public key sizes and is more efficient than Goppa code based McEliece encryption scheme.

Expand

Additional news items may be found on the IACR news page.