{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:07:33Z","timestamp":1775732853662,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226976","type":"print"},{"value":"9783032226983","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-22698-3_11","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:23:53Z","timestamp":1775730233000},"page":"342-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refined Modelling of\u00a0the\u00a0Primal Attack, and\u00a0Variants Against Module-LWE"],"prefix":"10.1007","author":[{"given":"Paola","family":"de Perthuis","sequence":"first","affiliation":[]},{"given":"Filip","family":"Trenki\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"11_CR1","unstructured":"Albrecht, M., Ducas, L.: Lattice attacks on NTRU and LWE: a history of refinements. Cryptology ePrint Archive, Report 2021\/799 (2021). https:\/\/eprint.iacr.org\/2021\/799"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., et al.: Estimate all the LWE, NTRU schemes! In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 351\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_19","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The general sieve kernel and new records in lattice reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., G\u00f6pfert, F., Virdia, F., Wunderer, T.: Revisiting the expected cost of solving uSVP and applications to LWE. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10624, pp. 297\u2013322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_11","DOI":"10.1007\/978-3-319-70694-8_11"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). http:\/\/www.degruyter.com\/view\/j\/jmc.2015.9.issue-3\/jmc-2015-0016\/jmc-2015-0016.xml","DOI":"10.1515\/jmc-2015-0016"},{"key":"11_CR6","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Holz, T., Savage, S. (eds.) USENIX Security 2016, pp. 327\u2013343. USENIX Association (2016). https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO\u00a02009. LNCS, vol.\u00a05677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Bai, S., Galbraith, S.D.: Lattice decoding attacks on binary LWE. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol.\u00a08544, pp. 322\u2013337. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08344-5_21","DOI":"10.1007\/978-3-319-08344-5_21"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Bai, S., Miller, S., Wen, W.: A refined analysis of the cost for solving LWE via uSVP. In: Buchmann, J., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2019. LNCS, vol. 11627, pp. 181\u2013205. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23696-0_10","DOI":"10.1007\/978-3-030-23696-0_10"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Bai, S., Stehl\u00e9, D., Wen, W.: Measuring, simulating and exploiting the head concavity phenomenon in BKZ. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0I. LNCS, vol. 11272, pp. 369\u2013404. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_13","DOI":"10.1007\/978-3-030-03326-2_13"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Bambury, H., Nguyen, P.Q.: Improved provable reduction of NTRU and hypercubic lattices. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography - 15th International Workshop, PQCrypto 2024, Part\u00a0I, pp. 343\u2013370. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_12","DOI":"10.1007\/978-3-031-62743-9_12"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Bonnoron, G., Ducas, L., Fillinger, M.: Large FHE gates from tensored homomorphic accumulator. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 217\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_13","DOI":"10.1007\/978-3-319-89339-6_13"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: CRYSTALS - kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy, pp. 353\u2013367. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-022-09441-3","volume":"36","author":"K Boudgoust","year":"2023","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: On the hardness of module learning with errors with short distributions. J. Cryptol. 36(1), 1 (2023). https:\/\/doi.org\/10.1007\/s00145-022-09441-3","journal-title":"J. Cryptol."},{"key":"11_CR15","unstructured":"Boudgoust, K., Jeudy, C., Tairi, E., Wen, W.: Hardness of m-LWE with general distributions and applications to leaky variants. Cryptology ePrint Archive, Paper 2025\/1472 (2025). https:\/\/eprint.iacr.org\/2025\/1472"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 309\u2013325. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT\u00a02011. LNCS, vol.\u00a07073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Choe, H., Hong, D., Yi, M.: SMAUG: pushing lattice-based key encapsulation mechanisms to the limits. In: Carlet, C., Mandal, K., Rijmen, V. (eds.) SAC 2023. LNCS, vol. 14201, pp. 127\u2013146. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-53368-6_7","DOI":"10.1007\/978-3-031-53368-6_7"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0II. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12","DOI":"10.1007\/978-3-030-56880-1_12"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Ducas, L., Durmus, A.: Ring-LWE in polynomial rings. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC\u00a02012. LNCS, vol.\u00a07293, pp. 34\u201351. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_3","DOI":"10.1007\/978-3-642-30057-8_3"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Ducas, L., Engelberts, L., de Perthuis, P.: Predicting module lattice reduction. In: ASIACRYPT (2025). https:\/\/eprint.iacr.org\/2025\/1904","DOI":"10.1007\/978-981-95-5099-9_5"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Ducas, L., Prest, T.: Fast Fourier orthogonalization, pp. 191\u2013198 (2016). https:\/\/doi.org\/10.1145\/2930889.2930923","DOI":"10.1145\/2930889.2930923"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/S00145-025-09560-7","volume":"39","author":"L Ducas","year":"2026","unstructured":"Ducas, L., Pulles, L.N.: Accurate score prediction for dual-sieve attacks. J. Cryptol. 39(1), 8 (2026). https:\/\/doi.org\/10.1007\/S00145-025-09560-7","journal-title":"J. Cryptol."},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"11_CR25","unstructured":"Gargava, N., Serban, V., Viazovska, M., Viglino, I.: Effective module lattices and their shortest vectors (2024). https:\/\/arxiv.org\/abs\/2402.10305"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Third Algorithmic Number Theory Symposium (ANTS). LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Cham (1998)","DOI":"10.1007\/BFb0054868"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N.: A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Menezes, A. (ed.) CRYPTO\u00a02007. LNCS, vol.\u00a04622, pp. 150\u2013169. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_9","DOI":"10.1007\/978-3-540-74143-5_9"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987). http:\/\/www.jstor.org\/stable\/3689974","DOI":"10.1287\/moor.12.3.415"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Karenin, A., Kirshanova, E.: Finding dense submodules with algebraic lattice reduction. In: Vaudenay, S., Petit, C. (eds.) AFRICACRYPT 2024. LNCS, vol. 14861, pp. 403\u2013427. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-64381-1_18","DOI":"10.1007\/978-3-031-64381-1_18"},{"key":"11_CR30","unstructured":"Kim, J., Park, J.H.: NTRU+: compact construction of NTRU using simple encoding method. Cryptology ePrint Archive, Report 2022\/1664 (2022). https:\/\/eprint.iacr.org\/2022\/1664"},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. DCC 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"DCC"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Lee, C., Pellet-Mary, A., Stehl\u00e9, D., Wallet, A.: An LLL algorithm for module lattices. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11922, pp. 59\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_3","DOI":"10.1007\/978-3-030-34621-8_3"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Lenstra, H.\u00a0W., J., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","DOI":"10.1007\/BF01457454"},{"key":"11_CR34","unstructured":"Li, J., Nguyen, P.Q.: A complete analysis of the BKZ lattice reduction algorithm. Cryptology ePrint Archive, Report 2020\/1237 (2020). https:\/\/eprint.iacr.org\/2020\/1237"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Micciancio, D.: On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Halevi, S. (ed.) CRYPTO\u00a02009. LNCS, vol.\u00a05677, pp. 577\u2013594. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_34","DOI":"10.1007\/978-3-642-03356-8_34"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT\u00a02013. LNCS, vol.\u00a07881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3","DOI":"10.1007\/978-3-642-38348-9_3"},{"issue":"1","key":"11_CR38","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Mukherjee, T., Stephens-Davidowitz, N.: Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0II. LNCS, vol. 12171, pp. 213\u2013242. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_8","DOI":"10.1007\/978-3-030-56880-1_8"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Nakamura, S., Yasuda, M.: An extension of Kannan\u2019s embedding for solving ring-based LWE problems. In: Paterson, M.B. (ed.) 18th IMA International Conference on Cryptography and Coding. LNCS, vol. 13129, pp. 201\u2013219. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92641-0_10","DOI":"10.1007\/978-3-030-92641-0_10"},{"key":"11_CR41","unstructured":"de Perthuis, P., Trenki\u0107, F.: Refined modelling of the primal attack, and variants against module-learning with errors. Cryptology ePrint Archive, Paper 2025\/2195 (2025). https:\/\/eprint.iacr.org\/2025\/2195"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Postlethwaite, E.W., Virdia, F.: On the success probability of solving unique SVP via BKZ. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 68\u201398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_4","DOI":"10.1007\/978-3-030-75245-3_4"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"11_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","journal-title":"Math. Program."},{"key":"11_CR45","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003, pp. 145\u2013156. Springer, Heidelberg (2003)"},{"key":"11_CR46","doi-asserted-by":"publisher","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2), 201\u2013224 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397587900648","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"11_CR47","unstructured":"Development team, T.F.: fpylll, a Python wrapper for the fplll lattice reduction library, Version: 0.6.4 (2025). https:\/\/github.com\/fplll\/fpylll"},{"key":"11_CR48","unstructured":"Development team, T.K.: King\u2019s Computational Research, Engineering and Technology Environment (CREATE) (2025)"},{"key":"11_CR49","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-981-97-4465-7_12","volume-title":"Mobile Internet Security","author":"S Uesugi","year":"2024","unstructured":"Uesugi, S., Okumura, S., Miyaji, A.: Revisiting an extension of Kannan\u2019s embedding for ring-LWE. In: You, I., Chora\u015b, M., Shin, S., Kim, H., Astillo, P.V. (eds.) Mobile Internet Security, pp. 167\u2013180. Springer, Singapore (2024)"}],"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-032-22698-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:24:01Z","timestamp":1775730241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22698-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226976","9783032226983"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22698-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","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":"Saint-Malo","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}