A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes

We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now, but has two major drawbacks: long key and low transmission rate. Our variant is based on QC-LDPC codes and is able to overcome such drawbacks, while avoiding the known attacks. Recently, however, a new attack has been discovered that can recover the private key with limited complexity. We show that such attack can be avoided by changing the form of some constituent matrices, without altering the remaining system parameters. We also propose another variant that exhibits an overall increased security level. We analyze the complexity of the encryption and decryption stages by adopting efficient algorithms for processing large circulant matrices. The Toom-Cook algorithm and the short Winograd convolution are considered, that give a significant speed-up in the cryptosystem operations. Key words: McEliece cryptosy...

• Type: Journal
• Year: 2008
• Where: SCN
• Authors: Marco Baldi, Marco Bodrato, Franco Chiaraluce
• Keywords: Communications, Mceliece Cryptosystem, Original Mceliece Cryptosystem, QC-LDPC Codes, SCN 2008