On improving security of GPT cryptosystems

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1110-1114

  Gabidulin, Ernst M ^a   Rashwan, Haitham ^b   Honary, Bahram ^a  

^a MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC APPLICATIONS; CRYPTOSYSTEMS; ERROR CORRECTING CODE; GPT CRYPTOSYSTEM; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS;

PUBLIC KEY CRYPTOGRAPHY;

INFORMATION THEORY;

EID: 70449504470     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206029     Document Type: Conference Paper

References (16)

1. R.J. McEliece, "A Public Key Cryptosystem Based on Algebraic Coding Theory," JPL DSN Progress Report 42- 44, Pasadena, CA, pp. 114-116, 1978.
2. E.M. Gabidulin, A.V. Paramonov, O.V. Tretjakov, "Ideals over a Non-commutative Ring and Their Application in Cryptology", in: Advances in Cryptology - Eurocrypt'91, Editor: D.W. Davies, Lecture Notes in Computer Science, No. 547, pp. 482-489, Berlin and Heidelberg: Springer-Verlag, 1991.
3. E.M. Gabidulin, "Public-Key Cryptosystems Based on Linear Codes over Large Alphabets: Efficiency and Weakness," in: Codes and Ciphers, Editor: P.G. Farrell, pp. 17- 32, Essex: Formara Limited, 1995.
4. J. K. Gibson, "Severely denting the Gabidulin version of the McEliece public key cryptosystem," // Designs, Codes and Cryptography, 6(1), 1995, pp. 37-45.
5. J. K. Gibson, "The security of the Gabidulin publickey cryptosystem," in: U. M. Maurer, ed. // Advances in Cryptology - EUROCRYPT'96, LNCS 1070, 1996, pp. 212-223.
6. E.M. Gabidulin, A.V. Ourivski, "Improved GPT Public Key Cryptosystems." // In: P. Farrell, M. Darnell, B. Honary (Ed's), "Coding, Communications, and Broadcasting", Research Studies Press, 2000, pp. 73-102.
7. A. V. Ourivski, E. M. Gabidulin, "Column Scrambler for the GPT Cryptosystem." // Discrete Applied Mathematics. 128(1): 207-221 (2003).
8. E. M. Gabidulin, A. V. Ourivski, B. Honary, B. Ammar, "Reducible Rank Codes and Their Applications to Cryptography." // IEEE Transactions on Information Theory. 49(12): 3289-3293 (2003).
9. A. S. Kshevetskiy, E. M. Gabidulin, "High-weight errors in public-key cryptosystems based on reducible rank codes." // In: Proc. of ISCTA, 2005.
10. R. Overbeck, "A new brute-force attack for GPT and variants." In: Proc. of Mycrypt'2005, vol. 3517 of LNCS, pp. 5-63, Springer-Verlag, 2005.
11. Overbeck R., "Brute-force attacks Public Key Cryptosystem Based on Gabidulin codes." J. Cryptology, 21(2): 280- 301 (2008).
12. E. M. Gabidulin, "Attacks and counter-attacks on the GPT public key cryptosystem," Designs, Codes and Cryptography. V. 48, No. 2/ August 2008. Pp. 171-177, Springer Netherlands, DOI 10.1007/s10623-007-9160-8.
13. E.M. Gabidulin, "Theory of Codes with Maximum Rank Distance," Probl. Inform. Transm., vol. 21, No. 1, pp. 1- 12, July, 1985.
14. E. M. Gabidulin, "A Fast Matrix Decoding Algorithm For Rank-Error-Correcting Codes." In: (Eds G. Cohen, S. Litsyn, A. Lobstein, G. Zemor), Algebraic coding, pp. 126-132, Lecture Notes in Computer Science No. 573, Springer-Verlag, Berlin, 1992.
15. T. Johansson, A.V. Ourivski, "New technique for decoding codes in the rank metric and its cryptography applications," Problems Inform. Transm. 38(3), 237246 (2002).
16. F. Levy-dit-Vehel1, J.-Ch. Jean-Charles Faug'ere, and L. Perret,"Cryptanalysis of MinRank." Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17- 21, 2008, Proceedings. Series: Lecture Notes in Computer Science. Subseries: Security and Cryptology, Vol. 5157. Wagner, David (Ed.). 2008. Pp. 280-296.