{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T05:12:08Z","timestamp":1776661928841,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_4","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:31:14Z","timestamp":1186349474000},"page":"33-48","source":"Crossref","is-referenced-by-count":382,"title":["Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"4_CR1","unstructured":"F. BLAKE, X. GAO, R. MULLIN, S. VANSTONE and T. YAGHOOBIAN, \u201cApplication of Finite Fields\u201d, Kluwer Academic Publishers."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/TIT.1979.1056010","volume":"IT-25","author":"G. Brassard","year":"1979","unstructured":"G. BRASSARD, \u201cA note on the complexity of cryptography\u201d, IEEE Tran. Inform. Theory, Vol. IT-25, pp. 232\u2013233, 1979.","journal-title":"IEEE Tran. Inform. Theory"},{"key":"4_CR3","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 and S. WINOGRAD, \u201cMatrix Multiplication via Arithmetic Progressions\u201d, J. Symbolic Computation, 1990, Vol. 9, pp. 251\u2013280.","journal-title":"J. Symbolic Computation"},{"key":"4_CR4","unstructured":"M. GAREY, D. JOHNSON, \u201cComputers and intractability, A Guide to the Theory of N P-Completeness\u201d, FREEMAN."},{"key":"4_CR5","unstructured":"R. LIDL, H. NIEDERREITER, \u201cFinite Fields\u201d, Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"T. MATSUMOTO and H. IMAI, \u201cPublic Quadratic Polynomial-tuples for efficient signature-verification and message-encryption\u201d, EUROCRYPT\u201988, Springer Verlag 1988, pp. 419\u2013453.","DOI":"10.1007\/3-540-45961-8_39"},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-51084-2_24","volume-title":"Symbolic and Algebraic Computation","author":"A. Menezes","year":"1989","unstructured":"A. MENEZES, P. VAN OORSCHOT ans S. VANSTONE, \u201cSome computational aspects of root finding in GF(q m )\u201d, in Symbolic and Algebraic Computation, Lecture Notes in Computer Science, 358 (1989), pp. 259\u2013270."},{"key":"4_CR8","first-page":"131","volume":"141","author":"G. L. Mullen","year":"1993","unstructured":"Gary L. MULLEN, \u201cPermutation Polynomials over Finite Fields\u201d, in \u201cFinite Fields, Coding Theory, and Advances in Communications and Computing\u201d, Dekker, Volume 141, 1993, pp. 131\u2013152.","journal-title":"Finite Fields, Coding Theory, and Advances in Communications and Computing"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"J. PATARIN, \u201cCryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt\u201988\u201d, CRYPTO\u201995, pp. 248\u2013261.","DOI":"10.1007\/3-540-44750-4_20"},{"key":"4_CR10","unstructured":"J. PATARIN, \u201cAsymmetric Cryptography with a Hidden Monomial\u201d, available but not yet published paper."},{"key":"4_CR11","unstructured":"B. SCHNEIER, \u201cApplied Cryptography\u201d, John Wiley and Sons, first edition."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"A. SHAMIR, \u201cAn efficient Identification Scheme Based on Permuted Kernels\u201d, CRYPTO\u201989, pp. 606\u2013609.","DOI":"10.1007\/0-387-34805-0_54"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"J. STERN, \u201cA new identification scheme based on syndrome decoding\u201d, CRYPTO\u201993, pp. 13\u201321.","DOI":"10.1007\/3-540-48329-2_2"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/18.32139","volume":"35","author":"P. Oorschot Van","year":"1989","unstructured":"P. VAN OORSCHOT and S. VANSTONE, \u201cA geometric approach to root finding in GF(q m ),\u201d IEEE Trans. Info. Th., 35 (1989), pp. 444\u2013453.","journal-title":"IEEE Trans. Info. Th."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"J. VON ZUR GATHEN and V. SHOUP, \u201cComputing Frobenius maps and factoring polynomials\u201d, Proc. 24th Annual ACM Symp. Theory of Comput., ACM Press, 1992.","DOI":"10.1145\/129712.129722"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:33:02Z","timestamp":1556724782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}