Designing an efficient and secure public-key cryptosystem based on reducible rank codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3348, Issue , 2004, Pages 218-229

  Berger, Thierry ^a   Loidreau, Pierre ^b  

^a UNIVERSITY OF LIMOGES   (France)

^b Ecole Nationale Supérieure de Techniques Avancées   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; PUBLIC KEY CRYPTOGRAPHY;

PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS; TRANSMISSION RATES;

PUBLIC KEY CRYPTOGRAPHY; CRYPTOGRAPHY;

EID: 35048902516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30556-9_18     Document Type: Article

References (25)

1. T. A. Berson. Failure of the McEliece public-key cryptosystem under message resend and related-message attack. In Advances in Cryptology, CRYPTO 1997, Lecture Notes in Computer Science, pages 213-220, 1997.
2. A. Canteaut and N. Sendrier. Cryptanalysis of the original McEliece cryptosystem. In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT'98, number 1514 in LNCS, pages 187-199, 1998.
3. N. Courtois, M. Finiasz and N. Sendrier. How to achieve a McEliece-based signature scheme. In Colin Boyd, Editors, Advances in Cryptology - ASIACRYPT'2001, number 2248 in LNCS, pages 151-174, 2001
4. F. Chabaud and J. Stern. The cryptographic security of the syndrome decoding problem for rank distance codes. In K. Kim and T. Matsumoto, editors, Advances in Cryptology - ASIACRYPT '96, volume 1163 of LNCS. Springer-Verlag, November 1996.
5. K. Chen. A new identification algorithm. In Cryptographic policy and algorithms, volume 1029, pages 244-249. Springer, 1996.
6. E. M. Gabidulin. Theory of codes with maximal rank distance. Problems of Information Transmission, 21:1-12, July 1985.
7. E. M. Gabidulin. A fast matrix decoding algorithm for rank-error correcting codes. In G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, editors, Algebraic coding, volume 573 of LNCS, pages 126-133. Springer-Verlag, 1991.
8. E. M. Gabidulin and A. V. Ourivski. Modified GPT PKC with right scrambler. In Daniel Augot and Claude Carlet, editors, Proceedings of the 2nd International workshop on Coding and Cryptography, WCC 2001, pages 233-242, 2001. ISBN Number : 2-761-1179-3.
9. E .M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov. Ideals over a non-commutative ring and their application in cryptology. LNCS, 547:482-489, 1991.
10. J. K. Gibson. Severely denting the Gabidulin version of the McEliece public-key cryptosystem. Designs, Codes and Cryptography, 6:37-45, 1995.
11. J. K. Gibson. The security of the Gabidulin public-key cryptosystem. In U. Maurer, editor, EUROCRYPT'96, pages 212-223, 1996.
12. C. Hall, I. Goldberg, and B. Schneier. Reaction attacks against several public-key cryptosystems. In Proceedings of the 2nd International Conference on Information and Communication Security, ICICS'99, number 1726 in LNCS, pages 2-12, 1999.
13. R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. Technical report, Jet Propulsion Lab. DSN Progress Report, 1978.
14. A. Ourivski and T. Johannson. New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, 38(3):237-246, September 2002.
15. A. V. Ourivski and E. M. Gabidulin. Column scrambler for the GPT cryptosystem. Discrete Applied Mathematics, 128(1):207-221, May 2003.
16. Special issue of the second International Workshop on Coding and Cryptography (WCC2001).
17. A. V. Ourivski, E. M. Gabidulin, B. Honary, and B. Ammar. Reducible rank codes and their applications to cryptography. IEEE Transactions on Information Theory, 49(12):3289-3293, December 2003.
18. G. Richter and S. Plass. Fast Decoding of Rank-Codes with Rank Errors and Column Erasures In Proceedings of ISIT 2004, 2004.
19. J. Daemen, V. Rijmen The Block Cipher Rijndael, Smart Card Research and Applications, LNCS 1820, J.-J. Quisquater and B. Schneier, Eds., Springer-Verlag, 2000, pp. 288-296.
20. J. Daemen, V. Rijmen Rijndael, the advanced encryption standard, Dr. Dobb's Journal , Vol. 26, No. 3, March 2001, pp. 137-139.
21. http: //www.esat.kuleuven.ac.be/_rijmen/rijndael/rijndaelref.zip
22. R. M. Roth. Maximum-Rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory, 37(2):328-336, March 1991.
23. N. Sendrier. Efficient generation of binary words of given weight. In C. Boyd, editor, Cryptography and Coding, 5th IMA Conference, Circencester, UK, LNCS, pages 184-187, December 1995.
24. H.-M. Sun. Enhancing the security of the McEliece public-key cryptosystem. Journal of Information Science and Engeneering, 16:799-812, 2000.
25. A. Vardy. The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory, 43(6): 1757-1766, November 1997.