Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes
作者： Pierre-Louis Cayrel , Gerhard Hoffmann , Edoardo Persichetti
DOI: 10.1007/978-3-642-30057-8_9
关键词: Mathematics 、 Cryptosystem 、 Linear code 、 Random oracle 、 Goppa code 、 McEliece cryptosystem 、 Encryption 、 Adaptive chosen-ciphertext attack 、 Code (cryptography) 、 Theoretical computer science 、 Algorithm
摘要: In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical encryption scheme based on generalized Srivastava codes, and successively convert our to CCA2-secure protocol in the random oracle model applying Fujisaki-Okamoto transform. contrast with all other code-based cryptosystems that work model, conversion does not require constant weight encoding function. results both 128-bit 80-bit security level, latter also feature an implementation embedded device.
springer.com
sci-hub.se 参考文章(38)
Progress in Cryptology - AFRICACRYPT 2009 Lecture Notes in Computer Science. ,vol. 5580, ,(2009) , 10.1007/978-3-642-02384-2
Topics in Cryptology – CT-RSA 2009 Lecture Notes in Computer Science. ,vol. 5473, ,(2009) , 10.1007/978-3-642-00862-7
Stefan Heyse, Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices Post-Quantum Cryptography. pp. 143- 162 ,(2011) , 10.1007/978-3-642-25405-5_10
Paulo S. L. M. Barreto, Pierre-Louis Cayrel, Rafael Misoczki, Robert Niebuhr, Quasi-dyadic CFS signatures international conference on information security and cryptology. pp. 336- 349 ,(2010) , 10.1007/978-3-642-21518-6_23
Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento, A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model the cryptographers track at the rsa conference. pp. 240- 251 ,(2009) , 10.1007/978-3-642-00862-7_16
Bhaskar Biswas, Nicolas Sendrier, McEliece Cryptosystem Implementation: Theory and Practice PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography. pp. 47- 62 ,(2008) , 10.1007/978-3-540-88403-3_4
Aggelos Kiayias, Moti Yung, Polynomial reconstruction based cryptography selected areas in cryptography. pp. 129- 133 ,(2001) , 10.1007/3-540-45537-X_10
Daniel J. Bernstein, Tanja Lange, Post Quantum Cryptography Nature. ,vol. 549, pp. 188- 194 ,(2008) , 10.1038/NATURE23461
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
Harald Niederreiter, A public-key cryptosystem based on shift register sequences theory and application of cryptographic techniques. pp. 35- 39 ,(1986) , 10.1007/3-540-39805-8_4