{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:39:25Z","timestamp":1743140365703,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319018539"},{"type":"electronic","value":"9783319018546"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01854-6_58","type":"book-chapter","created":{"date-parts":[[2013,8,8]],"date-time":"2013-08-08T06:47:25Z","timestamp":1375944445000},"page":"567-576","source":"Crossref","is-referenced-by-count":0,"title":["The Isomorphism of Polynomials Problem Applied to Multivariate Quadratic Cryptography"],"prefix":"10.1007","author":[{"given":"Marta Conde","family":"Pena","sequence":"first","affiliation":[]},{"given":"Ra\u00fal Dur\u00e1n","family":"D\u00edaz","sequence":"additional","affiliation":[]},{"given":"Luis Hern\u00e1ndez","family":"Encinas","sequence":"additional","affiliation":[]},{"given":"Jaime Mu\u00f1oz","family":"Masqu\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"58_CR1","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"58_CR2","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. PhD thesis, Stanford University (1979)"},{"key":"58_CR3","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical Report 42-44, Jet Propulsion Laboratory (1978)"},{"key":"58_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"58_CR5","unstructured":"Ding, J., Gower, J.E., Schmidt, D.: Multivariate Public Key Cryptosystems. Advances in Information Security, vol.\u00a025. Springer (2006)"},{"key":"58_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completness. W. H. Freeman & Co. (1990)"},{"key":"58_CR7","unstructured":"Wolf, C.: Multivariate Quadratic Polynomials in Public Key Criptography. PhD thesis, Katholieke Universiteit Leuven (November 2005)"},{"key":"58_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-44750-4_20","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"J. Patarin","year":"1995","unstructured":"Patarin, J.: Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocryptp\u201988. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 248\u2013261. Springer, Heidelberg (1995)"},{"key":"58_CR9","unstructured":"Feldmann, A.T.: A Survey of Attacks on Multivariate Cryptosystems. PhD thesis, University of Waterloo (2005)"},{"key":"58_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-38348-9_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C. Bouillaguet","year":"2013","unstructured":"Bouillaguet, C., Fouque, P.-A., V\u00e9ber, A.: Graph-theoretic algorithms for the \u2018isomorphism of polynomials\u2019 problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 211\u2013227. Springer, Heidelberg (2013)"},{"key":"58_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"T. Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 419\u2013453. Springer, Heidelberg (1988)"},{"key":"58_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"N. Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"58_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45664-3_15","volume-title":"Public Key Cryptography","author":"N. Courtois","year":"2002","unstructured":"Courtois, N., Goubin, L., Meier, W., Tacier, J.-D.: Solving underdefined systems of multivariate quadratic equations. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 211\u2013227. Springer, Heidelberg (2002)"},{"key":"58_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J. Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 33\u201348. Springer, Heidelberg (1996)"},{"key":"58_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"J. Patarin","year":"1998","unstructured":"Patarin, J., Goubin, L., Courtois, N.: Improved algorithms for isomorphisms of polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 184\u2013200. Springer, Heidelberg (1998)"},{"issue":"4","key":"58_CR16","first-page":"375","volume":"4","author":"C. Wolf","year":"2005","unstructured":"Wolf, C., Preneel, B.: Equivalent keys in multivariate quadratic public key systems. Journal of Mathematical Cryptology\u00a04(4), 375\u2013415 (2005)","journal-title":"Journal of Mathematical Cryptology"},{"key":"58_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30580-4_19","volume-title":"Public Key Cryptography - PKC 2005","author":"C. Wolf","year":"2005","unstructured":"Wolf, C., Preneel, B.: Large superfluous keys in $\\mathcal{M}$ultivariate $\\mathcal{Q}$uadratic asymmetric systems. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 275\u2013287. Springer, Heidelberg (2005)"},{"key":"58_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/11554868_4","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"C. Wolf","year":"2005","unstructured":"Wolf, C., Preneel, B.: Equivalent keys in HFE, C*, and variations. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 33\u201349. Springer, Heidelberg (2005)"},{"key":"58_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.-C. Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial equivalence problems: Algorithmic and theoretical aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 30\u201347. Springer, Heidelberg (2006)"},{"issue":"2","key":"58_CR20","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ffa.2011.09.001","volume":"18","author":"D. Lin","year":"2012","unstructured":"Lin, D., Faug\u00e8re, J.-C., Perret, L., Wang, T.: On enumeration of polynomial equivalence classes and their application to MPKC. Finite Fields and Their Applications\u00a018(2), 283\u2013302 (2012)","journal-title":"Finite Fields and Their Applications"},{"key":"58_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S1007-0214(11)70033-5","volume":"16","author":"L. Mingjie","year":"2011","unstructured":"Mingjie, L., Lidong, H., Xiaoyun, W.: On the equivalent keys in multivariate cryptosystems. Tsinghua Science & Technology\u00a016, 225\u2013232 (2011)","journal-title":"Tsinghua Science & Technology"}],"container-title":["Advances in Intelligent Systems and Computing","International Joint Conference SOCO\u201913-CISIS\u201913-ICEUTE\u201913"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01854-6_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T12:07:13Z","timestamp":1674130033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01854-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319018539","9783319018546"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01854-6_58","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}