New Results for Rank-Based Cryptography
作者： Philippe Gaborit , Olivier Ruatta , Julien Schrek , Gilles Zémor
DOI: 10.1007/978-3-319-06734-6_1
关键词: Financial cryptography 、 Strong cryptography 、 Rank (computer programming) 、 PKCS #1 、 Cryptography 、 Theoretical computer science 、 Cryptosystem 、 Computer science 、 Low-density parity-check code 、 Public-key cryptography
摘要: In this paper we survey new results for rank-based cryptography: cryptosystems which are based on error-correcting codes embedded with the rank metric. These first concern LRPC cryptosystem, a cryptosystem class of decodable codes: (for Low Rank Parity Check codes) can be seen as an analog classical LDPC but The benefit from very small public keys less than 2,000 bits and is moreover fast. We also present optimized attacks solving general case syndrome decoding problem, together zero-knowledge authentication scheme signature mixed errors-erasures codes, both these systems having few thousand bits. recent highlight that cryptography has many good features used practical cryptosystems.
springer.com
archives-ouvertes.fr
sci-hub.se 参考文章(36)
Progress in Cryptology - AFRICACRYPT 2009 Lecture Notes in Computer Science. ,vol. 5580, ,(2009) , 10.1007/978-3-642-02384-2
Anja Becker, Antoine Joux, Alexander May, Alexander Meurer, Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding Advances in Cryptology – EUROCRYPT 2012. pp. 520- 536 ,(2012) , 10.1007/978-3-642-29011-4_31
Philippe Gaborit, Julien Schrek, Gilles Zémor, Full Cryptanalysis of the Chen Identification Protocol Post-Quantum Cryptography. pp. 35- 50 ,(2011) , 10.1007/978-3-642-25405-5_3
Kefei Chen, A New Identification Algorithm Proceedings of the International Conference on Cryptography: Policy and Algorithms. pp. 244- 249 ,(1995) , 10.1007/BFB0032363
Jeffrey Shallit, Eric Bach, Algorithmic number theory MIT Press. ,(1996)
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
Thierry Berger, Pierre Loidreau, Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes Progress in Cryptology - INDOCRYPT 2004. pp. 218- 229 ,(2004) , 10.1007/978-3-540-30556-9_18
Joachim Von Zur Gathen, Jurgen Gerhard, Modern Computer Algebra ,(1999)
Nicolas T. Courtois, Matthieu Finiasz, Nicolas Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme international conference on the theory and application of cryptology and information security. ,vol. 2248, pp. 157- 174 ,(2001) , 10.1007/3-540-45682-1_10