{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:05:12Z","timestamp":1751601912973,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319790626"},{"type":"electronic","value":"9783319790633"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-79063-3_17","type":"book-chapter","created":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T14:23:38Z","timestamp":1522506218000},"page":"355-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rank Analysis of Cubic Multivariate Cryptosystems"],"prefix":"10.1007","author":[{"given":"John","family":"Baena","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Cabarcas","sequence":"additional","affiliation":[]},{"given":"Daniel E.","family":"Escudero","sequence":"additional","affiliation":[]},{"given":"Karan","family":"Khathuria","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Verbel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aliasgari, M., Sadeghi, M.R., Panario, D.: Gr\u00f6bner bases for lattices and an algebraic decoding algorithm. In: 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1414\u20131415, September 2011","DOI":"10.1109\/Allerton.2011.6120333"},{"key":"17_CR2","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: Eighth International Symposium on Effective Methods in Algebraic Geometry, MEGA 2005, pp. 1\u201314 (2005)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9617-2","volume":"69","author":"L Bettale","year":"2013","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Des. Codes Crypt. 69(1), 1\u201352 (2013)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"JF Buss","year":"1999","unstructured":"Buss, J.F., Frandsen, G.S., Shallit, J.O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3), 572\u2013596 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR5","unstructured":"Chen, C.-H.O., Chen, M.-S., Ding, J., Werner, F., Yang, B.-Y.: Odd-char multivariate hidden field equations. IACR Cryptology ePrint Archive, 2008:543 (2008)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-22792-9_41","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Ding","year":"2011","unstructured":"Ding, J., Hodges, T.J.: Inverting HFE systems is quasi-polynomial for all fields. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 724\u2013742. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_41"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-11659-4_5","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2014","unstructured":"Ding, J., Petzoldt, A., Wang, L.: The cubic simple matrix encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 76\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_5"},{"key":"17_CR8","unstructured":"Escudero, D.: Groebner bases and applications to the security of multivariate public key cryptosystems (2016). http:\/\/cs.au.dk\/~escudero\/files\/TDG.pdf. Accessed 25 Nov 2017"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jsc.2010.10.014","volume":"46","author":"J-C Faug\u00e8re","year":"2011","unstructured":"Faug\u00e8re, J.-C., El Din, M.S., Spaenlehauer, P.-J.: Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): algorithms and complexity. J. Symb. Comput. 46(4), 406\u2013437 (2011)","journal-title":"J. Symb. Comput."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases $$(F_4)$$. J. Pure Appl. Algebra 139(1-3), 61\u201388 (1999). (Effective methods in algebraic geometry, Saint-Malo (1998))","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (f5). In: Proceedings of 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75\u201383. ACM, New York (2002)","DOI":"10.1145\/780506.780516"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-C Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 280\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_16"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44448-3_4","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2000","author":"L Goubin","year":"2000","unstructured":"Goubin, L., Courtois, N.T.: Cryptanalysis of the TTM cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 44\u201357. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_4"},{"key":"17_CR14","series-title":"Mathematics for Industry","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-981-10-5065-7_2","volume-title":"Mathematical Modelling for Next-Generation Cryptography","author":"Y Hashimoto","year":"2018","unstructured":"Hashimoto, Y.: Multivariate public key cryptosystems. In: Takagi, T., Wakayama, M., Tanaka, K., Kunihiro, N., Kimoto, K., Duong, D. (eds.) Mathematical Modelling for Next-Generation Cryptography. Mathematics for Industry, vol. 29, pp. 17\u201342. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-10-5065-7_2"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"45:1","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are NP-hard. J. ACM 60(6), 45:1\u201345:39 (2013)","journal-title":"J. ACM"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ffa.2014.07.001","volume":"30","author":"TJ Hodges","year":"2014","unstructured":"Hodges, T.J., Petit, C., Schlather, J.: First fall degree and weil descent. Finite Fields Appl. 30, 155\u2013177 (2014)","journal-title":"Finite Fields Appl."},{"issue":"Suppl. C","key":"17_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0024-3795(78)90052-6","volume":"22","author":"TD Howell","year":"1978","unstructured":"Howell, T.D.: Global properties of tensor rank. Linear Algebra Appl. 22(Suppl. C), 9\u201323 (1978)","journal-title":"Linear Algebra Appl."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201999","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0024-3795(77)90069-6","volume":"18","author":"JB Kruskal","year":"1977","unstructured":"Kruskal, J.B.: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra Appl. 18(2), 95\u2013138 (1977)","journal-title":"Linear Algebra Appl."},{"key":"17_CR20","series-title":"Graduate Studies in Mathematics","volume-title":"Tensors: Geometry and Applications","author":"JM Landsberg","year":"2012","unstructured":"Landsberg, J.M.: Tensors: Geometry and Applications. Graduate Studies in Mathematics, vol. 128. American Mathematical Society, Providence (2012)"},{"key":"17_CR21","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, 2nd edn, vol. 20. Cambridge University Press, Cambridge (1997). With a foreword by P.M. Cohn"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Makarim, R.H., Stevens, M.: M4GB: an efficient Gr\u00f6bner-basis algorithm. In: Proceedings of 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, pp. 293\u2013300. ACM, New York (2017)","DOI":"10.1145\/3087604.3087638"},{"key":"17_CR23","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 \u2014 EUROCRYPT \u201988","author":"T Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 419\u2013453. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-11659-4_11","volume-title":"Post-Quantum Cryptography","author":"D Moody","year":"2014","unstructured":"Moody, D., Perlner, R., Smith-Tone, D.: An asymptotically optimal structural attack on the ABC multivariate encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 180\u2013196. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_11"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-59879-6_15","volume-title":"Post-Quantum Cryptography","author":"D Moody","year":"2017","unstructured":"Moody, D., Perlner, R., Smith-Tone, D.: Improved attacks for characteristic-2 parameters of the cubic ABC simple matrix encryption scheme. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 255\u2013271. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_15"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-319-69453-5_29","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"D Moody","year":"2017","unstructured":"Moody, D., Perlner, R., Smith-Tone, D.: Key recovery attack on the cubic ABC simple matrix multivariate encryption scheme. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 543\u2013558. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_29"},{"key":"17_CR27","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 \u2014 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. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-45353-9_21","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 282\u2013297. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_21"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-11659-4_14","volume-title":"Post-Quantum Cryptography","author":"J Porras","year":"2014","unstructured":"Porras, J., Baena, J., Ding, J.: ZHFE, a new multivariate public key encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 229\u2013245. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_14"},{"key":"17_CR30","unstructured":"Shmuel, F.: Remarks on the symmetric rank of symmetric tensors, January 2016. arXiv.org\/pdf\/1505.00860"},{"key":"17_CR31","unstructured":"Shmuel, F., Stawiska, M.: Best approximation on semi-algebraic sets and k-border rank approximation of symmetric tensors, November 2013. arXiv.org\/pdf\/1311.1561"},{"key":"17_CR32","unstructured":"Spaenlehauer, P.-J.: Solving multi-homogeneous and determinantal systems. Algorithms - Complexity - Applications. Ph.D. thesis, Universit\u00e9 Paris 6 (2012)"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/11506157_43","volume-title":"Information Security and Privacy","author":"B-Y Yang","year":"2005","unstructured":"Yang, B.-Y., Chen, J.-M.: Building secure tame-like multivariate public-key cryptosystems: the new TTS. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 518\u2013531. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11506157_43"},{"issue":"4","key":"17_CR34","doi-asserted-by":"publisher","first-page":"851","DOI":"10.3934\/amc.2016045","volume":"10","author":"I\u00c1 Barrientos","year":"2016","unstructured":"Barrientos, I.\u00c1., Borges-Quintana, M., Borges-Trenard, M.A., Panario, D.: Computing Gr\u00f6bner bases associated with lattices. Adv. Math. Commun. 10(4), 851\u2013860 (2016)","journal-title":"Adv. Math. Commun."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-79063-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T08:53:56Z","timestamp":1751532836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-79063-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319790626","9783319790633"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-79063-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.fau.edu\/pqcrypto2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}