{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:07Z","timestamp":1767339547432,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752446"},{"type":"electronic","value":"9783030752453"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75245-3_7","type":"book-chapter","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T15:04:51Z","timestamp":1619795091000},"page":"155-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of Multivariate Encryption Schemes: Application to Dob"],"prefix":"10.1007","author":[{"given":"Morten","family":"\u00d8ygarden","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Felke","sequence":"additional","affiliation":[]},{"given":"H\u00e5vard","family":"Raddum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-44223-1_17","volume-title":"Post-Quantum Cryptography","author":"D Apon","year":"2020","unstructured":"Apon, D., Moody, D., Perlner, R., Smith-Tone, D., Verbel, J.: Combinatorial rank attacks against the rectangular simple matrix encryption scheme. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 307\u2013322. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_17"},{"key":"7_CR2","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: Complexity of Gr\u00f6bner basis computation for Semi-regular Overdetermined sequences over $$\\mathbb{F}_2$$ with solutions in $$\\mathbb{F}_2$$. (2003). [Research Report] RR-5049, INRIA, inria-00071534"},{"issue":"3","key":"7_CR3","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. Cryptology 3(3), 177\u2013197 (2009)","journal-title":"J. Math. Cryptology"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Carlet. S.: Vectorial boolean functions for cryptography. In: Crama, Y., Hammer, P.L., (eds.), Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398\u2013469. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511780448.012"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-030-10970-7_13","volume-title":"Selected Areas in Cryptography - SAC 2018","author":"R Cartor","year":"2019","unstructured":"Cartor, R., Smith-Tone, D.: EFLASH: a new multivariate encryption scheme. In: Cid Jr., C., Jacobson, M. (eds.) Selected Areas in Cryptography - SAC 2018, vol. 11349, pp. 281\u2013299. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_13"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-33027-8_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"Chen-Mou Cheng","year":"2012","unstructured":"Cheng, Chen-Mou, Chou, Tung, Niederhagen, Ruben, Yang, Bo-Yin: Solving quadratic equations with XL on parallel architectures. In: Prouff, Emmanuel, Schaumont, Patrick (eds.) CHES 2012. LNCS, vol. 7428, pp. 356\u2013373. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_21"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/b138611","volume-title":"Using Algebraic Geometry","author":"DA Cox","year":"2006","unstructured":"Cox, D.A., Little, J., O\u2019shea, D.: Using Algebraic Geometry. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/b138611"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-24632-9_22","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J Ding","year":"2004","unstructured":"Ding, J.: A new variant of the matsumoto-imai cryptosystem through perturbation. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 305\u2013318. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24632-9_22"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/11745853_19","volume-title":"Public Key Cryptography - PKC 2006","author":"J Ding","year":"2006","unstructured":"Ding, J., Gower, J.E.: Inoculating multivariate schemes against differential attacks. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 290\u2013301. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_19"},{"key":"7_CR10","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":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-79063-3_18","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2018","unstructured":"Ding, J., Perlner, R., Petzoldt, A., Smith-Tone, D.: Improved cryptanalysis of HFEv- via projection. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 375\u2013395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_18"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-30580-4_20","volume-title":"Public Key Cryptography - PKC 2005","author":"J Ding","year":"2005","unstructured":"Ding, J., Schmidt, D.: Cryptanalysis of HFEv and internal perturbation of HFE. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 288\u2013301. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_20"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/18.761283","volume":"45","author":"H Dobbertin","year":"1999","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on GF (2\/sup n\/): the welch case. IEEE Trans. Inf. Theory 45(4), 1271\u20131275 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-71677-8_17","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"V Dubois","year":"2007","unstructured":"Dubois, V., Granboulan, L., Stern, J.: Cryptanalysis of HFE with internal perturbation. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 249\u2013265. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_17"},{"issue":"1\u20133","key":"7_CR15","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(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. algebra"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J-C Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gr\u00f6bner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_3"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11426639_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P-A Fouque","year":"2005","unstructured":"Fouque, P.-A., Granboulan, L., Stern, J.: Differential cryptanalysis for multivariate schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 341\u2013353. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_20"},{"key":"7_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781683922643","volume-title":"Commutative Algebra: An Introduction","author":"JW Hoffman","year":"2016","unstructured":"Hoffman, J.W., Jia, X., Wang, H.: Commutative Algebra: An Introduction. Stylus Publishing, LLC (2016)"},{"key":"7_CR19","unstructured":"https:\/\/github.com\/Simula-UiB\/Attack-On-The-Dob-Encryption-Scheme"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-89339-6_14","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"G Macario-Rat","year":"2018","unstructured":"Macario-Rat, G., Patarin, J.: Two-face: new public key multivariate schemes. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 252\u2013265. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_14"},{"key":"7_CR21","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":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-40186-3_5","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"M \u00d8ygarden","year":"2020","unstructured":"\u00d8ygarden, M., Felke, P., Raddum, H., Cid, C.: Cryptanalysis of the multivariate encryption scheme EFLASH. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 85\u2013105. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_5"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-44750-4_20","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"J Patarin","year":"1995","unstructured":"Patarin, J.: Cryptanalysis of the matsumoto and imai public key scheme of eurocrypt 1988. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 248\u2013261. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_20"},{"key":"7_CR24","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":"7_CR25","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-44223-1_21","volume-title":"Post-Quantum Cryptography","author":"D Smith-Tone","year":"2020","unstructured":"Smith-Tone, D., Verbel, J.: A rank attack against extension field cancellation. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 381\u2013401. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_21"},{"key":"7_CR27","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). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_12"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.ffa.2015.06.001","volume":"35","author":"C Tao","year":"2015","unstructured":"Tao, C., Xiang, H., Petzoldt, A., Ding, J.: Simple matrix-a multivariate public key cryptosystem (MPKC) for encryption. Finite Fields Appl. 35, 352\u2013368 (2015)","journal-title":"Finite Fields Appl."},{"issue":"9","key":"7_CR29","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1587\/transfun.E102.A.1028","volume":"102","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Ikematsu, Y., Duong, D.H., Takagi, T.: The secure parameters and efficient decryption algorithm for multivariate public key cryptosystem EFC. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(9), 1028\u20131036 (2019)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1","key":"7_CR30","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D Wiedemann","year":"1986","unstructured":"Wiedemann, D.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR31","unstructured":"Wolf, C., Preneel, B.: Taxonomy of public key schemes based on the problem of multivariate quadratic equations. Cryptology ePrint Archive, Report 2005\/077 (2005). https:\/\/eprint.iacr.org\/2005\/077"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-030-44223-1_22","volume-title":"Post-Quantum Cryptography","author":"T Yasuda","year":"2020","unstructured":"Yasuda, T., Wang, Y., Takagi, T.: Multivariate encryption schemes based on polynomial equations over real numbers. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 402\u2013421. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_22"},{"key":"7_CR33","unstructured":"\u00d8ygarden, M., Felke, P., Raddum, H.: Analysis of Multivariate Encryption Schemes: Application to Dob. Cryptology ePrint Archive, Report 2020\/1442 (2020). https:\/\/eprint.iacr.org\/2020\/1442 (Extended Version)"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75245-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T00:05:56Z","timestamp":1714435556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75245-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752446","9783030752453"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75245-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Web-Submission-and-Review","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","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":"52","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":"33% - 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":"15","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}