{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,20]],"date-time":"2026-11-20T17:49:17Z","timestamp":1795196957925,"version":"4.10.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645184","type":"print"},{"value":"9783540697954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054126","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T05:13:04Z","timestamp":1153977184000},"page":"184-200","source":"Crossref","is-referenced-by-count":50,"title":["Improved algorithms for isomorphisms of polynomials"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis","family":"Goubin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Courtois","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"14_CR1","first-page":"254","volume":"36","author":"L. Babai","year":"1988","unstructured":"L\u00e1szl\u00f3 Babai, Shlomo Moran, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, JCSS, vol. 36, 1988, pp. 254\u2013276.","journal-title":"JCSS"},{"key":"14_CR2","unstructured":"Manuel Blum, How to prove a theorem so no one else can claim it, Proceeedings of the International Congress of Mathematics, Berkeley CA, 1986, pp. 1444\u20131451."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. B. Boppana","year":"1987","unstructured":"Ravi B. Boppana, Johan H\u00e5stad, Stathis Zachos, Does co-NP have short interactive proofs, Information Proc. Letters, vol. 25, 1987, pp. 127\u2013132.","journal-title":"Information Proc. Letters"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Don Coppersmith, Shmuel Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Computation (1990), 9, pp. 251\u2013280.","journal-title":"J. Symbolic Computation"},{"key":"14_CR5","unstructured":"Scott Fortin, The Graph Isomorphism Problem, Technical Report 93-20, University of Alberta, Edmonton, Alberta, Canada, July 1996. This paper is available at ftp:\/\/ftp.cs.ualberta.ca\/pub\/TechReports\/1996\/TR96-20\/TR96-20.ps.gz"},{"issue":"n.1","key":"14_CR6","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Oded Goldreich, Silvio Micali, Avi Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Journal of the ACM, v. 38, n. 1, Jul. 1991, pp. 691\u2013729.","journal-title":"Journal of the ACM"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Shafi Goldwasser, Silvio Micali, Charles Rackoff, The knowledge complexity of interactive proofs, SIAM J. Comput., vol. 18, 1989, pp. 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"14_CR8","unstructured":"Shafi Goldwasser, Michael Sipser, Private coins vs. public coins in interactive proof systems, Advances in Computing Research, S. Micali (Ed.), vol. 5, 1989, pp. 73\u201390."},{"key":"14_CR9","unstructured":"John Gustafson, Srinivas Aluru, Massively Parallel Searching for Better Algorithms or, How to Do a Cross Product with Five Multiplications, Ames Laboratory, Department of Energy, ISU, Ames, Iowa. This paper is available at http:\/\/www.scl.ameslab.gov\/Publications\/FiveMultiplications\/Five.html"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J. H\u00e5stad","year":"1990","unstructured":"Johan H\u00e5stad, Tensor Rank is NP-Complete, Journal of Algorithms, vol. 11, pp. 644\u2013654, 1990.","journal-title":"Journal of Algorithms"},{"key":"14_CR11","unstructured":"Rudolf Lidl, Harald Niederreiter, \u201cFinite Fields\u201d, Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Tsutomu Matsumoto, Hideki Imai, Public quadratic polynomial-Tuples for efficient Signature-Verification and Message-Encryption, EUROCRYPT'88, Springer-Verlag, pp. 419\u2013453.","DOI":"10.1007\/3-540-45961-8_39"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Jacques Patarin, Cryptanalysis of the Matsumoto and Imai public Key Scheme of Eurocrypt'88, CRYPTO'95, Springer-Verlag, pp. 248\u2013261.","DOI":"10.1007\/3-540-44750-4_20"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Jacques Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of asymmetric Algorithms, EUROCRYPT'96, Springer-Verlag, pp. 33\u201348.","DOI":"10.1007\/3-540-68339-9_4"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Erev Petrank, Ron M. Roth, Is Code Equivalence Easy to Decide?, IEEE Transactions on Information Theory, 1997.","DOI":"10.1109\/18.623157"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Volker Strassen, Gaussian elimination is not optimal, Numerische Mathematik 13, 1969, pp. 354\u2013356.","journal-title":"Numerische Mathematik"},{"key":"14_CR17","first-page":"102","volume":"384","author":"V. Strassen","year":"1988","unstructured":"Volker Strassen, The asymptotic spectrum of tensors, J. Reine Angew. Math., vol. 384, pp. 102\u2013152, 1988.","journal-title":"J. Reine Angew. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:36:51Z","timestamp":1555735011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0054126","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0054112","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}