2015/12/28 by Yongge Wang, Wang, Yongge
Computer Science · #11T71 #68P25 #94A60 #94B05 #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1512.08454
openalex publication_date 2015/12/28 · openalex created_date 2021/12/06 · openalex updated_date 2026/07/28
Lattice based encryption schemes and linear code based encryption schemes\nhave received extensive attention in recent years since they have been\nconsidered as post-quantum candidate encryption schemes. Though LLL reduction\nalgorithm has been one of the major cryptanalysis techniques for lattice based\ncryptographic systems, key recovery cryptanalysis techniques for linear code\nbased cryptographic systems are generally scheme specific. In recent years,\nseveral important techniques such as Sidelnikov-Shestakov attack, filtration\nattacks, and algebraic attacks have been developed to crypt-analyze linear code\nbased encryption schemes. Though most of these cryptanalysis techniques are\nrelatively new, they prove to be very powerful and many systems have been\nbroken using them. Thus it is important to design linear code based\ncryptographic systems that are immune against these attacks. This paper\nproposes linear code based encryption scheme RLCE which shares many\ncharacteristics with random linear codes. Our analysis shows that the scheme\nRLCE is secure against existing attacks and we hope that the security of the\nRLCE scheme is equivalent to the hardness of decoding random linear codes.\nExample parameters for different security levels are recommended for the scheme\nRLCE.\n