{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T16:41:45Z","timestamp":1751906505724},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030442224"},{"type":"electronic","value":"9783030442231"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-44223-1_22","type":"book-chapter","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T23:04:06Z","timestamp":1586473446000},"page":"402-421","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multivariate Encryption Schemes Based on Polynomial Equations over Real Numbers"],"prefix":"10.1007","author":[{"given":"Takanori","family":"Yasuda","sequence":"first","affiliation":[]},{"given":"Yacheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,10]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/JMC.2009.009","volume":"3","author":"L Bettale","year":"2009","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. J. Math. Cryptol. 3(3), 177\u2013197 (2009)","journal-title":"J. Math. Cryptol."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0168-9274(02)00170-8","volume":"44","author":"S Bellavia","year":"2003","unstructured":"Bellavia, S., Macconi, M., Morini, B.: An affine scaling trust-region approach to bound-constrained nonlinear systems. Appl. Numer. Math. 44, 257\u2013280 (2003)","journal-title":"Appl. Numer. Math."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780500140516","volume":"20","author":"S Bellavia","year":"2005","unstructured":"Bellavia, S., Morini, B.: An interior global method for nonlinear systems with simple bounds. Optim. Methods Softw. 20, 1\u201322 (2005)","journal-title":"Optim. Methods Softw."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-19379-8_27","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"L Bettale","year":"2011","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Cryptanalysis of multivariate and odd-characteristic HFE variants. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 441\u2013458. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19379-8_27"},{"key":"22_CR5","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 3rd edn. Athena Scientific, Nashua (2016)","edition":"3"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-00862-7_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"C Clough","year":"2009","unstructured":"Clough, C., Baena, J., Ding, J., Yang, B.-Y., Chen, M.: Square, a new multivariate encryption scheme. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 252\u2013264. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00862-7_17"},{"key":"22_CR7","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis","year":"1983","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)"},{"key":"22_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-36946-4","volume-title":"Multivariate Public Key Cryptosystems, Advances in Information Security","author":"J Ding","year":"2006","unstructured":"Ding, J., Gower, J.E., Schmidt, D.S.: Multivariate Public Key Cryptosystems, Advances in Information Security, vol. 25. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/978-0-387-36946-4"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11496137_12","volume-title":"Applied Cryptography and Network Security","author":"J Ding","year":"2005","unstructured":"Ding, J., Schmidt, D.: Rainbow, a new multivariable polynomial signature scheme. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 164\u2013175. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11496137_12"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-17373-8_32","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"V Dubois","year":"2010","unstructured":"Dubois, V., Gama, N.: The degree of regularity of HFE systems. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 557\u2013576. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17373-8_32"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00607-004-0083-1","volume":"74","author":"JY Fan","year":"2005","unstructured":"Fan, J.Y., Pan, Y.X.: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption. Computing 74, 23\u201339 (2005)","journal-title":"Computing"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"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 ISSAC 2002, pp. 75\u201383. ACM Press (2002)","key":"22_CR13","DOI":"10.1145\/780506.780516"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.7146\/math.scand.a-12092","volume":"56","author":"R Fr\u00f6berg","year":"1985","unstructured":"Fr\u00f6berg, R.: An inequality for Hilbert series of graded algebras. Mathematica Scandinavia 56, 117\u2013144 (1985)","journal-title":"Mathematica Scandinavia"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00222-004-0366-3","volume":"157","author":"F G\u00f6tze","year":"2004","unstructured":"G\u00f6tze, F.: Lattice point problems and value of quadratic forms. Invent. math. 157, 195\u2013226 (2004)","journal-title":"Invent. math."},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-319-79063-3_19","volume-title":"Post-Quantum Cryptography","author":"Y Ikematsu","year":"2018","unstructured":"Ikematsu, Y., Perlner, R., Smith-Tone, D., Takagi, T., Vates, J.: HFERP - a new multivariate encryption scheme. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 396\u2013416. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-79063-3_19"},{"doi-asserted-by":"crossref","unstructured":"Kanzow, C.: An active-set type newton method for constrained nonlinear systems. In: Complementarity: Applications, Algorithms and Extensions, pp. 179\u2013200. Kluwer Academic (2001)","key":"22_CR17","DOI":"10.1007\/978-1-4757-3279-5_9"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.cam.2004.02.013","volume":"172","author":"C Kanzow","year":"2004","unstructured":"Kanzow, C., Yamashita, N., Fukushima, M.: Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints. J. Comput. Appl. Math. 172(2), 375\u2013397 (2004)","journal-title":"J. Comput. Appl. Math."},{"key":"22_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970944","volume-title":"Iterative Methods for Linear and Nonlinear Equations","author":"CT Kelly","year":"1995","unstructured":"Kelly, C.T.: Iterative Methods for Linear and Nonlinear Equations. SIAM, Philadelphia (1995)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K Levenberg","year":"1944","unstructured":"Levenberg, K.: A method for the solution of certain nonlinear problems in least square. Quart. Appl. Math. 2, 164\u2013166 (1944)","journal-title":"Quart. Appl. Math."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"DW Marquardt","year":"1963","unstructured":"Marquardt, D.W.: An algorithm for least-square estimation on nonlinear problems. SIAM J. Appl. Math. 11, 431\u2013441 (1963)","journal-title":"SIAM J. Appl. Math."},{"key":"22_CR22","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S1052623497318980","volume":"9","author":"RDC Monteiro","year":"1999","unstructured":"Monteiro, R.D.C., Pang, J.S.: A potential reduction Newton method for constrained equations. SIAM J. Optim. 9, 729\u2013754 (1999)","journal-title":"SIAM J. Optim."},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-02295-1_2","volume-title":"The LLL Algorithm: Survey and Applications","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen, P.Q.: Hermite\u2019s constant and lattice algorithms. In: Nguyen, P., Vall\u00e9e, B. (eds.) The LLL Algorithm: Survey and Applications, pp. 19\u201369. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02295-1_2"},{"key":"22_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/978-0-387-40065-5","edition":"2"},{"key":"22_CR26","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). \nhttps:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-48797-6_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Petzoldt","year":"2015","unstructured":"Petzoldt, A., Chen, M.-S., Yang, B.-Y., Tao, C., Ding, J.: Design principles for HFEv- based multivariate signature schemes. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 311\u2013334. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48797-6_14"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1023\/B:JOTA.0000025712.43243.eb","volume":"120","author":"L Qi","year":"2004","unstructured":"Qi, L., Tong, X.J., Li, D.H.: An active-set projected trust region algorithm for box constrained nonsmooth equations. J. Optim. Theor. Appl. 120, 601\u2013649 (2004)","journal-title":"J. Optim. Theor. Appl."},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-29360-8_12","volume-title":"Post-Quantum Cryptography","author":"A Szepieniec","year":"2016","unstructured":"Szepieniec, A., Ding, J., Preneel, B.: Extension field cancellation: a new central trapdoor for multivariate quadratic systems. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 182\u2013196. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29360-8_12"},{"unstructured":"Szepieniec, A., Preneel, B.: Short solutions to nonlinear systems of equations. Cryptology ePrint archive: report 2017\/1175. \nhttps:\/\/eprint.iacr.org\/2017\/1175","key":"22_CR30"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-38616-9_16","volume-title":"Post-Quantum Cryptography","author":"C Tao","year":"2013","unstructured":"Tao, C., Diene, A., Tang, S., Ding, J.: Simple matrix scheme for encryption. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 231\u2013242. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38616-9_16"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623499356344","volume":"11","author":"M Ulbrich","year":"2001","unstructured":"Ulbrich, M.: Nonmonotone trust-region methods for vound-constrained semismooth equations with applications to nonlinear mixed complementarity problems. SIAM J. Optim. 11, 889\u2013917 (2001)","journal-title":"SIAM J. Optim."},{"key":"22_CR33","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02592210","volume":"74","author":"T Wang","year":"1996","unstructured":"Wang, T., Monteiro, R.D.C., Pang, J.S.: An interior point potential reduction method for constrained equations. Math. Program. 74, 159\u2013195 (1996)","journal-title":"Math. Program."},{"key":"22_CR34","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-7091-6217-0_18","volume-title":"Computing Supplementa","author":"N Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the LM method. In: Alefeld, G., Chen, X. (eds.) Computing Supplementa, vol. 15, pp. 237\u2013249. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-6217-0_18"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-27800-9_24","volume-title":"Information Security and Privacy","author":"B-Y Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M.: Theoretical analysis of XL over small fields. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 277\u2013288. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27800-9_24"},{"key":"22_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11496618_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B-Y Yang","year":"2005","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the XL family: theory and practice. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 67\u201386. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11496618_7"},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-01446-9_8","volume-title":"Provable Security","author":"T Yasuda","year":"2018","unstructured":"Yasuda, T.: Multivariate encryption schemes based on the constrained MQ problem. In: Baek, J., Susilo, W., Kim, J. (eds.) ProvSec 2018. LNCS, vol. 11192, pp. 129\u2013146. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-01446-9_8"},{"key":"22_CR38","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3934\/naco.2011.1.15","volume":"1","author":"YX Yuan","year":"2011","unstructured":"Yuan, Y.X.: Recent advances in numerical methods for nonlinear equations and nonlinear least squares. Numer. Algebra Control Optim. 1, 15\u201334 (2011)","journal-title":"Numer. Algebra Control Optim."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44223-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T23:16:03Z","timestamp":1586474163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44223-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030442224","9783030442231"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44223-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 April 2020","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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2020.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}