Cryptanalysis of the TTM cryptosystem

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

Volumn 1976, Issue , 2000, Pages 44-57

  Louis, Louis Goubin ^a   Courtois, Nicolas T ^a  

^a Bull CP8 ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE PROBLEMS; LINEAR ALGEBRA; MOBILE SECURITY; SECURITY OF DATA; TRUCK TRAILERS;

INVERSE FUNCTIONS; LINEAR ALGEBRA PROBLEMS; LINEAR COMBINATIONS; LOW DEGREE; MULTIVARIATE EQUATIONS; RANDOM POLYNOMIALS; TRAPDOOR FUNCTIONS; TRIANGULAR SYSTEM;

CRYPTOGRAPHY;

EID: 84937500998     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. E.R. Berlekamp, R.J. McEliece, H.C.A. Van Tilborg, On the inherent intractability of certain coding problems, IEEE Transactions on Information Theory, IT-24(3), pp. 384-386, May 1978.
2. F. Chabaud, Asymptotic analysis of probabilistic algorithms for finding short codewords, in Proceedings of Eurocode’92, Udine, Italy, CISM Courses and lectures no 339, Springer-Verlag, 1993, pp. 217-228.
3. K. Chen, A new identification algorithm, Cryptography Policy and Algorithms Conference, LNCS no 1029, Springer-Verlag, 1996.
4. C. Y. Chou, D. J. Guan, J. M. Chen, A systematic construction of a Q2k-module in TTM, Preprint, October 1999. Available at http://www.usdsi.com/chou.ps
5. D. Coppersmith, S. Winograd, Matrixm ultiplication via arithmetic progressions, J. Symbolic Computation (1990), 9, pp. 251-280.
6. D. Coppersmith, J. Stern, S. Vaudenay, Attacks on the Birational Permutation Signature Schemes, in Advances in Cryptology, Proceedings of Crypto’93, LNCS no 773, Springer-Verlag, 1993, pp. 435-443.
7. D. Coppersmith, J. Stern, S. Vaudenay, The Security of the Birational Permutation Signature Schemes, in Journal of Cryptology, 10(3), pp. 207-221, 1997.
8. N. Courtois, A. Shamir, J. Patarin, A. Klimov, Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations, in Advances in Cryptology, Proceedings of EUROCRYPT’2000, LNCS no 807, Springer, 2000, pp. 392-407.
9. N. Courtois: La sécurité des primitives cryptographiques basées sur les problèmes algébriques multivariables MQ, IP, MinRank, et HFE, PhDt hesis, Paris 6 University, 26 September 2000, partly in English.
10. N. Courtois: The Minrank problem. MinRank, a new Zero-knowledge scheme based on the NP-complete problem. Presented at the rump session of Crypto 2000, available at http://www.minrank.org
11. H. Fell, W. Diffie, Analysis of a public key approach based on polynomial substitutions, in Advances in Cryptology, Proceedings of CRYPTO’85, LNCS no 218, Springer-Verlag, 1985, pp. 340-349.
12. E.M. Gabidulin, Theory of codes with maximum rank distance, Problems of Information Transmission, 21:1-12, 1985.
13. S. Harari, A new authentication algorithm, in Coding Theory and Applications, LNCS n◦ 388, Springer, 1989, pp. 204-211.
14. A. Kipnis, A. Shamir, Cryptanalysis of the HFE public key cryptosystem, in Advances in Cryptology, Proceedings of Crypto’99, LNCS no 1666, Springer, 1999, pp. 19-30.
15. T.T. Moh, A public key system with signature and master key functions, Communications in Algebra, 27(5), pp. 2207-2222, 1999. Available at http://www.usdsi.com/public.ps
16. T.T. Moh, A fast public key system with signature and master key functions, in Proceedings of CrypTEC’99, InternationalWorkshop on Cryptographic Techniques and E-commerce, Hong-Kong City University Press, pp. 63-69, July 1999. Available at http://www.usdsi.com/cryptec.ps
17. J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms, in Advances in Cryptology, Proceedings of EUROCRYPT’96, LNCS no 1070, Springer Verlag, 1996, pp. 33-48.
18. J. Patarin, L. Goubin, Asymmetric cryptography with S-Boxes, in Proceedings of ICICS’97, LNCS no 1334, Springer, 1997, pp. 369-380.
19. J.O. Shallit, G.S. Frandsen, J.F. Buss, The computational complexity of some problems of linear algebra, BRICS series report, Aarhus, Denmark, RS-96-33. Available at http://www.brics.dk/RS/96/33
20. A. Shamir, Efficient Signature Schemes based on Birational Permutations, in Advances in Cryptology, Proceedings of Crypto’93, LNCS no 773, Springer-Verlag, 1993, pp. 1-12.
21. J. Stern, A new identification scheme based on syndrome decoding, in Advances in Cryptology, Proceedings of CRYPTO’93, LNCS no 773, Springer-Verlag, 1993, pp. 13-21.
22. J. Stern, F. Chabaud, The cryptographic security of the Syndrome Decoding problem for rank distance codes, in Advances in Cryptology, Proceedings of ASIACRYPT’ 96, LNCS no 1163, Springer-Verlag, 1985, pp. 368-381.
23. The US Data Security Public-Key Contest, available at http://www.usdsi.com/contests.html