{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:58:05Z","timestamp":1775285885493,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540414049","type":"print"},{"value":"9783540444480","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44448-3_4","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:22:44Z","timestamp":1181362964000},"page":"44-57","source":"Crossref","is-referenced-by-count":109,"title":["Cryptanalysis of the TTM Cryptosystem"],"prefix":"10.1007","author":[{"given":"Louis","family":"Goubin","sequence":"first","affiliation":[]},{"given":"Nicolas T.","family":"Courtois","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,10,27]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"IT-24","author":"E.R. Berlekamp","year":"1978","unstructured":"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\u2013386, May 1978.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR2","first-page":"217","volume":"339","author":"F. Chabaud","year":"1993","unstructured":"F. Chabaud, Asymptotic analysis of probabilistic algorithms for finding short codewords, in Proceedings of Eurocode\u201992, Udine, Italy, CISM Courses and lectures n\u00b0 339, Springer-Verlag, 1993, pp. 217\u2013228.","journal-title":"Proceedings of Eurocode\u201992"},{"key":"4_CR3","series-title":"Lect Notes Comput Sci","volume-title":"A new identification algorithm","author":"K. Chen","year":"1996","unstructured":"K. Chen, A new identification algorithm, Cryptography Policy and Algorithms Conference, LNCS n\u00b0 1029, Springer-Verlag, 1996."},{"key":"4_CR4","unstructured":"C. Y. Chou, D. J. Guan, J. M. Chen, A systematic construction of a Q\n                  2k-module in TTM, Preprint, October 1999. Available at \n                    http:\/\/www.usdsi.com\/chou.ps"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith, S. Winograd, Matrixm ultiplication via arithmetic progressions, J. Symbolic Computation (1990), 9, pp. 251\u2013280.","journal-title":"J. Symbolic Computation"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","first-page":"435","volume-title":"Advances in Cryptology","author":"D. Coppersmith","year":"1993","unstructured":"D. Coppersmith, J. Stern, S. Vaudenay, Attacks on the Birational Permutation Signature Schemes, in Advances in Cryptology, Proceedings of Crypto\u201993, LNCS n\u00b0 773, Springer-Verlag, 1993, pp. 435\u2013443."},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s001459900028","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"D. Coppersmith, J. Stern, S. Vaudenay, The Security of the Birational Permutation Signature Schemes, in Journal of Cryptology, 10(3), pp. 207\u2013221, 1997.","journal-title":"Journal of Cryptology"},{"key":"4_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology","author":"N. Courtois","year":"2000","unstructured":"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\u20192000, LNCS n\u00b0 1807, Springer, 2000, pp. 392\u2013407."},{"key":"4_CR9","unstructured":"N. Courtois: La s\u00e9curit\u00e9 des primitives cryptographiques bas\u00e9es sur les probl\u00e8mes alg\u00e9briques multivariables MQ, IP, MinRank, et HFE, PhDt hesis, Paris 6 University, 26 September 2000, partly in English."},{"key":"4_CR10","unstructured":"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 \n                    http:\/\/www.minrank.org"},{"key":"4_CR11","series-title":"Lect Notes Comput Sci","first-page":"340","volume-title":"Advances in Cryptology","author":"H. Fell","year":"1985","unstructured":"H. Fell, W. Diffie, Analysis of a public key approach based on polynomial substitutions, in Advances in Cryptology, Proceedings of CRYPTO\u201985, LNCS n\u00b0 218, Springer-Verlag, 1985, pp. 340\u2013349."},{"key":"4_CR12","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"E.M. Gabidulin, Theory of codes with maximum rank distance, Problems of Information Transmission, 21:1\u201312, 1985.","journal-title":"Problems of Information Transmission"},{"key":"4_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BFb0019849","volume-title":"Coding Theory and Applications","author":"S. Harari","year":"1989","unstructured":"S. Harari, A new authentication algorithm, in Coding Theory and Applications, LNCS n\u00b0 388, Springer, 1989, pp. 204\u2013211."},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology","author":"A. Kipnis","year":"1999","unstructured":"A. Kipnis, A. Shamir, Cryptanalysis of the HFE public key cryptosystem, in Advances in Cryptology, Proceedings of Crypto\u201999, LNCS n\u00b0 1666, Springer, 1999, pp. 19\u201330."},{"issue":"5","key":"4_CR15","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1080\/00927879908826559","volume":"27","author":"T.T. Moh","year":"1999","unstructured":"T.T. Moh, A public key system with signature and master key functions, Communications in Algebra, 27(5), pp. 2207\u20132222, 1999. Available at \n                    http:\/\/www.usdsi.com\/public.ps","journal-title":"Communications in Algebra"},{"key":"4_CR16","unstructured":"T.T. Moh, A fast public key system with signature and master key functions, in Proceedings of CrypTEC\u201999, InternationalWorkshop on Cryptographic Techniques and E-commerce, Hong-Kong City University Press, pp. 63\u201369, July 1999. Available at \n                    http:\/\/www.usdsi.com\/cryptec.ps"},{"key":"4_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology","author":"J. Patarin","year":"1996","unstructured":"J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms, in Advances in Cryptology, Proceedings of EUROCRYPT\u201996, LNCS n\u00b0 1070, Springer Verlag, 1996, pp. 33\u201348."},{"key":"4_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BFb0028492","volume-title":"Proceedings of ICICS\u201997","author":"J. Patarin","year":"1997","unstructured":"J. Patarin, L. Goubin, Asymmetric cryptography with S-Boxes, in Proceedings of ICICS\u201997, LNCS n\u00b0 1334, Springer, 1997, pp. 369\u2013380."},{"key":"4_CR19","unstructured":"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 \n                    http:\/\/www.brics.dk\/RS\/96\/33"},{"key":"4_CR20","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1993","unstructured":"A. Shamir, Efficient Signature Schemes based on Birational Permutations, in Advances in Cryptology, Proceedings of Crypto\u201993, LNCS n\u00b0 773, Springer-Verlag, 1993, pp. 1\u201312."},{"key":"4_CR21","series-title":"Lect Notes Comput Sci","first-page":"13","volume-title":"Advances in Cryptology","author":"J. Stern","year":"1993","unstructured":"J. Stern, A new identification scheme based on syndrome decoding, in Advances in Cryptology, Proceedings of CRYPTO\u201993, LNCS n\u00b0 773, Springer-Verlag, 1993, pp. 13\u201321."},{"key":"4_CR22","series-title":"Lect Notes Comput Sci","first-page":"368","volume-title":"Advances in Cryptology","author":"J. Stern","year":"1985","unstructured":"J. Stern, F. Chabaud, The cryptographic security of the Syndrome Decoding problem for rank distance codes, in Advances in Cryptology, Proceedings of ASIACRYPT\u2019 96, LNCS n\u00b0 1163, Springer-Verlag, 1985, pp. 368\u2013381."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44448-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:10:34Z","timestamp":1550387434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44448-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414049","9783540444480"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44448-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}