{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:08:27Z","timestamp":1743109707340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031627453"},{"type":"electronic","value":"9783031627460"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62746-0_6","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T09:02:26Z","timestamp":1718010146000},"page":"109-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial XL: A Variant of\u00a0the\u00a0XL Algorithm Using Macaulay Matrices over\u00a0Polynomial Rings"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Furue","sequence":"first","affiliation":[]},{"given":"Momonari","family":"Kudo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"issue":"8","key":"6_CR1","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1016\/j.jsc.2012.01.002","volume":"47","author":"M-R Albrecht","year":"2012","unstructured":"Albrecht, M.-R., Cid, C., Faug\u00e8re, J.-C., Perret, L.: On the relation between the MXL family of algorithms and Gr\u00f6bner basis algorithms. J. Symb. Comput. 47(8), 926\u2013941 (2012)","journal-title":"J. Symb. Comput."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-30539-2_24","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"G Ars","year":"2004","unstructured":"Ars, G., Faug\u00e8re, J.-C., Imai, H., Kawazoe, M., Sugita, M.: Comparison between XL and Gr\u00f6bner basis algorithms. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 338\u2013353. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30539-2_24"},{"key":"6_CR3","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8ms alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. PhD thesis, Universit\u00e9 Pierre et Marie Curie-Paris VI, 2004"},{"key":"6_CR4","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations (extended abstract). In: ICPSS 2004, pp. 71\u201374 (2004)"},{"key":"6_CR5","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: MEGA 2005 (2005)"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bellini, E., Makarim, R.H., Sanna, C., Verbel, J.: An estimator for the hardness of the MQ problem. In: Batina, L., Daemen, J. (eds.) Progress in Cryptology \u2013 AFRICACRYPT 2022. AFRICACRYPT 2022. LNCS, vol. 13503, pp. 323\u2013347. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17433-9_14","DOI":"10.1007\/978-3-031-17433-9_14"},{"key":"6_CR7","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, 177\u2013197 (2009)","journal-title":"J. Math. Cryptol."},{"key":"6_CR8","unstructured":"Beullens, W., Campos, F., Celi, S., Hess, B., Kannwischer, M.J.: MAYO specification, 2023. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/mayo-spec-web.pdf"},{"key":"6_CR9","unstructured":"Beullens, W., et al.: UOV: unbalanced oil and vinegar algorithm specifications and supporting documentation version 1.0. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/UOV-spec-web.pdf"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3-4), 235\u2013265 (1997)","DOI":"10.1006\/jsco.1996.0125"},{"key":"6_CR11","unstructured":"Buchberger, B.: Ein algorithmus zum auffinden der basiselemente des restklassenringes nach einem nulldimensionalen polynomideal. PhD thesis, Universit\u00e4t Innsbruck, 1965"},{"key":"6_CR12","unstructured":"Buchmann, J.A., Ding, J., Mohamed, M.S.E., Mohamed, W.S.A.E.: MutantXL: solving multivariate polynomial equations for cryptanalysis. In: Dagstuhl seminar proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"key":"6_CR13","unstructured":"Capaverde, J.G.: Gr\u00f6bner Bases: Degree Bounds and Generic Ideals. PhD thesis, Clemson University, 2014"},{"key":"6_CR14","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 \u2014 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. 1807, pp. 392\u2013407. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_27"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Cox, D.-A., Little, J., O\u2019Shea, D.: Using Algebraic Geometry, second edn. Springer, New York (2005). https:\/\/doi.org\/10.1007\/b138611","DOI":"10.1007\/b138611"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Cox, D.-A. , Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, fourth edn. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16721-3","DOI":"10.1007\/978-3-319-16721-3"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30539-2_23","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"C Diem","year":"2004","unstructured":"Diem, C.: The XL-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 323\u2013337. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30539-2_23"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.jalgebra.2014.09.029","volume":"423","author":"C Diem","year":"2015","unstructured":"Diem, C.: Bounded regularity. J. Algebra 423, 1143\u20131160 (2015)","journal-title":"J. Algebra"},{"key":"6_CR19","series-title":"Advances in Information Security","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-0716-0987-3","volume-title":"Multivariate Public Key Cryptosystems","author":"J Ding","year":"2020","unstructured":"Ding, J., Petzoldt, A., Schmidt, D.S.: Multivariate Public Key Cryptosystems. AIS, vol. 80. Springer, New York (2020). https:\/\/doi.org\/10.1007\/978-1-0716-0987-3"},{"key":"6_CR20","unstructured":"Duarte, J.D.: On the complexity and admissible parameters of the Crossbred algorithm in $$\\mathbb{F}_{q\\ge 2}$$. Cryptology ePrint Archive, Paper 2023\/1664, 2023"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1137\/0219053","volume":"19","author":"T-W Dub\u00e9","year":"1990","unstructured":"Dub\u00e9, T.-W.: The structure of polynomial ideals and Gr\u00f6bner bases. SIAM J. Comput. 19(4), 750\u2013773 (1990)","journal-title":"SIAM J. Comput."},{"key":"6_CR22","unstructured":"Esser, A., Verbel, J., Zweydinger, F., Bellini, E.: NonProportional CryptographicEstimators software library for cryptographic hardness estimation. Cryptology ePrint Archive, Paper 2023\/589, 2023. Paper 2023\/589, 2023"},{"issue":"1\u20133","key":"6_CR23","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":"6_CR24","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: ISSAC 2002, pp. 75\u201383. ACM (2002)"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J-C Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"key":"6_CR26","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. Math. Scand. 56, 117\u2013144 (1985)","journal-title":"Math. Scand."},{"key":"6_CR27","unstructured":"Furue, H., et al.: QR-UOV specification document, 2023. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/qruov-spec-web.pdf"},{"key":"6_CR28","unstructured":"Gaggero, G., Gorla, E.: The complexity of solving a random polynomial system, 2023. arxiv:2309.03855"},{"key":"6_CR29","unstructured":"Gall, F.L.: Powers of tensors and fast matrix multiplication. In: ISSAC 2014, pp. 296\u2013303. ACM (2014)"},{"key":"6_CR30","unstructured":"Garey, M.-R., Johnson, D.-S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Gathen, J.V.Z., Shoup, V.: Computing Frobenius maps and factoring polynomials. Comput. Complex. 2(3), 87\u2013224 (1992)","DOI":"10.1007\/BF01272074"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Greuerl, G.-M., Pfister, G.: A Singular Introduction to Commutative Algebra (2nd Edition). Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-662-04963-1","DOI":"10.1007\/978-3-662-04963-1"},{"issue":"2","key":"6_CR33","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1049\/ise2.12092","volume":"17","author":"Y Ikematsu","year":"2023","unstructured":"Ikematsu, Y., Nakamura, S., Takagi, T.: Recent progress in the security evaluation of multivariate public-key cryptography. IET Inf. Secur. 17(2), 210\u2013226 (2023)","journal-title":"IET Inf. Secur."},{"key":"6_CR34","unstructured":"Technology\u00a0Innovation Institute. Multivariate quadratic estimator. https:\/\/estimators.crypto.tii.ae\/configuration?id=MQEstimator"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-76620-1_1","volume-title":"Number-Theoretic Methods in Cryptology","author":"A Joux","year":"2018","unstructured":"Joux, A., Vitse, V.: A crossbred algorithm for solving Boolean polynomial systems. In: Kaczorowski, J., Pieprzyk, J., Pomyka\u0142a, J. (eds.) NuTMiC 2017. LNCS, vol. 10737, pp. 3\u201321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76620-1_1"},{"issue":"223","key":"6_CR36","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1090\/S0025-5718-98-00944-2","volume":"67","author":"E Kaltofen","year":"1998","unstructured":"Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. Math. Comp. 67(223), 1179\u20131197 (1998)","journal-title":"Math. Comp."},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206\u2013222. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_15"},{"key":"6_CR38","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\u2019 99","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"},{"key":"6_CR39","unstructured":"Kudo, M., Yokoyama, K.: The solving degrees for computing Gr\u00f6bner bases of affine semi-regular polynomial sequences, 2024. arXiv:2404.03530"},{"key":"6_CR40","unstructured":"Kudo, M., Yokoyama, K.: On Hilbert-Poincar\u00e9 series of affine semi-regular polynomial sequences and related Gr\u00f6bner bases. In Mathematical Foundations for Post-Quantum Cryptography, page 26 pages. Springer, 2024, to appear arXiv:2401.07768"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-09519-5_62","volume-title":"Symbolic and Algebraic Computation","author":"D Lazard","year":"1979","unstructured":"Lazard, D.: Systems of algebraic equations. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 88\u201394. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_62"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume-title":"Computer Algebra","author":"D Lazard","year":"1983","unstructured":"Lazard, D.: Gr\u00f6bner bases, Gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) EUROCAL 1983. LNCS, vol. 162, pp. 146\u2013156. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-12868-9_99"},{"key":"6_CR43","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jsc.2020.04.007","volume":"104","author":"G McGuire","year":"2021","unstructured":"McGuire, G., O\u2019Hara, D.: On the termination of the general XL algorithm and ordinary multinomials. J. Symb. Comput. 104, 90\u2013104 (2021)","journal-title":"J. Symb. Comput."},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-88403-3_14","volume-title":"Post-Quantum Cryptography","author":"MSE Mohamed","year":"2008","unstructured":"Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: solving polynomial equations over GF(2) using an improved mutant strategy. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 203\u2013215. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_14"},{"key":"6_CR45","unstructured":"Mohamed, W.S.A.: Improvements for the XL algorithm with applications to algebraic cryptanalysis. PhD thesis, TU Darmstadt (2011)"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Nakamura, S.: Admissible parameter sets and complexity estimation of Crossbred algorithm. Cryptology ePrint Archive, Paper 2023\/1687 (2023)","DOI":"10.2139\/ssrn.4876774"},{"issue":"4","key":"6_CR47","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.jalgebra.2010.04.018","volume":"324","author":"K Pardue","year":"2010","unstructured":"Pardue, K.: Generic sequences of polynomials. J. Algebra 324(4), 579\u2013590 (2010)","journal-title":"J. Algebra"},{"key":"6_CR48","unstructured":"Salizzoni, F.: An upper bound for the solving degree in terms of the degree of regularity, 2023. arXiv:2304.13485"},{"key":"6_CR49","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.jalgebra.2020.08.035","volume":"565","author":"I Semaev","year":"2021","unstructured":"Semaev, I., Tenti, A.: Probabilistic analysis on Macaulay matrices over finite fields and complexity constructing Gr\u00f6bner bases. J. Algebra 565, 651\u2013674 (2021)","journal-title":"J. Algebra"},{"issue":"4","key":"6_CR50","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"6_CR51","unstructured":"Tenti, A.: Sufficiently overdetermined random polynomial systems behave like semiregular ones. PhD thesis, University of Bergen (2019)"},{"issue":"1","key":"6_CR52","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"DH Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor. 32(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"6_CR53","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02328447","volume":"2","author":"W-T Wu","year":"1986","unstructured":"Wu, W.-T.: Basic principles of mechanical theorem proving in elementary geometries. J. Autom. Reason. 2(3), 221\u2013252 (1986)","journal-title":"J. Autom. Reason."},{"key":"6_CR54","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). https:\/\/doi.org\/10.1007\/11496618_7"},{"key":"6_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-30191-2_31","volume-title":"Information and Communications Security","author":"B-Y Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M., Courtois, N.T.: On asymptotic security estimates in XL and Gr\u00f6bner bases-related algebraic cryptanalysis. In: Lopez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 401\u2013413. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30191-2_31"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-74619-5_19","volume-title":"Fast Software Encryption","author":"B-Y Yang","year":"2007","unstructured":"Yang, B.-Y., Chen, O.C.-H., Bernstein, D.J., Chen, J.-M.: Analysis of QUAD. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 290\u2013308. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_19"},{"key":"6_CR57","unstructured":"Yasuda, T., Dahan, X., Huang, Y.-J., Takagi, T., Sakurai, K.: MQ challenge: hardness evaluation of solving multivariate quadratic problems, 2015. NIST Workshop on Cybersecurity in a Post-Quantum World"},{"key":"6_CR58","doi-asserted-by":"crossref","unstructured":"Yun, D.Y.Y.: On square-free decomposition algorithm. In: ISSAC 1976, pp. 26\u201335. ACM (1976)","DOI":"10.1145\/800205.806320"}],"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-031-62746-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T13:19:15Z","timestamp":1732195155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62746-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627453","9783031627460"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62746-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maths.ox.ac.uk\/events\/conferences\/pqcrypto-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}