Practical Key Recovery Attacks On Two McEliece Variants.

作者: Gregor Leander , Valérie Gauthier-Umaña

DOI:

关键词:

摘要: The McEliece cryptosystem is a promising alternative to conventional public key encryption systems like RSA and ECC. In particular, it supposed resist even attackers equipped with quantum computers. Moreover, the process requires only simple binary operations making good candidate for low cost devices RFID tags. However, McEliece's original scheme has drawback that keys are very large. Two variants have been proposed overcome this disadvantage. rst one due Berger et al. presented at AFRICACRYPT 2009 second Barreto Misoczki SAC 2009. paper we present general attack framework apply both schemes subsequently. Our allows us recover private most parameters by authors of within few days on single PC.

参考文章(12)
Thierry P. Berger, Pierre-Louis Cayrel, Philippe Gaborit, Ayoub Otmani, Reducing Key Length of the McEliece Cryptosystem international conference on cryptology in africa. pp. 77- 97 ,(2009) , 10.1007/978-3-642-02384-2_6
Rafael Misoczki, Paulo S. L. M. Barreto, Compact McEliece Keys from Goppa Codes Selected Areas in Cryptography. ,vol. 5867, pp. 376- 392 ,(2009) , 10.1007/978-3-642-05445-7_24
Florence Jessie MacWilliams, Neil James Alexander Sloane, The Theory of Error-Correcting Codes ,(1977)
Thomas Eisenbarth, Tim Güneysu, Stefan Heyse, Christof Paar, MicroEliece: McEliece for Embedded Devices cryptographic hardware and embedded systems. pp. 49- 64 ,(2009) , 10.1007/978-3-642-04138-9_4
WIEB BOSMA, JOHN CANNON, CATHERINE PLAYOUST, The MAGMA algebra system I: the user language Journal of Symbolic Computation. ,vol. 24, pp. 235- 265 ,(1997) , 10.1006/JSCO.1996.0125
Marco Baldi, Franco Chiaraluce, Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes international symposium on information theory. pp. 2591- 2595 ,(2007) , 10.1109/ISIT.2007.4557609
C. Monico, J. Rosenthal, A. Shokrollahi, Using low density parity check codes in the McEliece cryptosystem international symposium on information theory. pp. 215- ,(2000) , 10.1109/ISIT.2000.866513
M. Weiser, The Computer for the 21st Century Scientific American. ,vol. 265, pp. 94- 104 ,(1991) , 10.1038/SCIENTIFICAMERICAN0991-94
Christian Wieschebrink, Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography international symposium on information theory. pp. 1733- 1737 ,(2006) , 10.1109/ISIT.2006.261651
P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring foundations of computer science. pp. 124- 134 ,(1994) , 10.1109/SFCS.1994.365700