{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:18:44Z","timestamp":1742926724307,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031803079"},{"type":"electronic","value":"9783031803086"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-80308-6_4","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T04:56:59Z","timestamp":1733979419000},"page":"75-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Approx-SVP in\u00a0Multiquadratic Ideal Lattices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3857-8548","authenticated-orcid":false,"given":"Semen Aleksandrovich","family":"Novoselov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-56620-7_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Bauch","year":"2017","unstructured":"Bauch, J., Bernstein, D.J., de Valence, H., Lange, T., van Vredendaal, C.: Short generators without quantum computers: the case of multiquadratics. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, pp. 27\u201359. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_2"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bernard, O., Fouque, P.A., Lesavourey, A.: Computing e-th roots in number fields. In: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 207\u2013219. SIAM (2024)","DOI":"10.1137\/1.9781611977929.16"},{"key":"4_CR4","unstructured":"Bernard, O., Lesavourey, A., Nguyen, T.H., Roux-Langlois, A.: Log-S-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP. Cryptology ePrint Archive, Report 2021\/1384 (2021). https:\/\/ia.cr\/2021\/1384"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bernard, O., Roux-Langlois, A.: Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 349\u2013380. Springer (2020)","DOI":"10.1007\/978-3-030-64834-3_12"},{"issue":"1","key":"4_CR6","first-page":"84","volume":"2","author":"JF Biasse","year":"2022","unstructured":"Biasse, J.F., Erukulangara, M.R., Fieker, C., Hofmann, T., Youmans, W.: Mildly short vectors in ideals of cyclotomic fields without quantum computers. Math. Cryptol. 2(1), 84\u2013107 (2022)","journal-title":"Math. Cryptol."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1112\/jlms.12563","volume":"105","author":"JF Biasse","year":"2022","unstructured":"Biasse, J.F., Fieker, C., Hofmann, T., Page, A.: Norm relations and computational problems in number fields. J. Lond. Math. Soc. 105(4), 2373\u20132414 (2022)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2140\/obs.2019.2.103","volume":"2","author":"JF Biasse","year":"2019","unstructured":"Biasse, J.F., Van Vredendaal, C.: Fast multiquadratic S-unit computation and application to the calculation of class groups. Open Book Ser. 2(1), 103\u2013118 (2019)","journal-title":"Open Book Ser."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Short Stickelberger class relations and application to Ideal-SVP. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 324\u2013348. Springer (2017)","DOI":"10.1007\/978-3-319-56620-7_12"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. J. ACM 68(2) (2021)","DOI":"10.1145\/3431725"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptographic Hardw. Embed. Syst. 2018(1), 238\u2013268 (2018)","journal-title":"IACR Trans. Cryptographic Hardw. Embed. Syst."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Fieker, C., Hart, W., Hofmann, T., Johansson, F.: Nemo\/Hecke: computer algebra and number theory packages for the Julia programming language. In: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, pp. 157\u2013164 (2017)","DOI":"10.1145\/3087604.3087611"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s00037-005-0193-y","volume":"14","author":"V Guruswami","year":"2005","unstructured":"Guruswami, V., Micciancio, D., Regev, O.: The complexity of the covering radius problem. Comput. Complexity 14, 90\u2013121 (2005)","journal-title":"Comput. Complexity"},{"key":"4_CR15","unstructured":"Hua, L.K.: Introduction to Number Theory. Springer Science & Business Media (1982)"},{"key":"4_CR16","first-page":"22","volume":"58","author":"SA Novoselov","year":"2022","unstructured":"Novoselov, S.A.: On ideal class group computation of imaginary multiquadratic fields. Prikl. Diskr. Mat 58, 22\u201330 (2022)","journal-title":"Prikl. Diskr. Mat"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Novoselov, S. A.: On the discrete logarithm problem in the ideal class group of multiquadratic fields. In: International Conference on Cryptology and Information Security in Latin America, pp. 192\u2013211. Springer (2023)","DOI":"10.1007\/978-3-031-44469-2_10"},{"key":"4_CR18","unstructured":"Page, A.: abelianbnf (2020). https:\/\/hal.inria.fr\/hal-02961482"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Peikert, C., Rosen, A.: Lattices that admit logarithmic worst-case to average-case connection factors. In: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, pp. 478\u2013487 (2007)","DOI":"10.1145\/1250790.1250860"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Pellet-Mary, A., Hanrot, G., Stehl\u00e9, D.: Approx-SVP in ideal lattices with pre-processing. In: Advances in Cryptology\u2013EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part II 38, pp. 685\u2013716. Springer (2019)","DOI":"10.1007\/978-3-030-17656-3_24"},{"key":"4_CR21","unstructured":"Regev, O.: Lattices in computer science: CVP algorithm (2004). https:\/\/cims.nyu.edu\/regev\/teaching\/lattices_fall_2004\/ln\/cvp.pdf"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Schirokauer, O.: Discrete logarithms and local units. Philos. Trans. Roy. Soc. Lond. Ser. A Phys. Eng. Sci. 345(1676), 409\u2013423 (1993)","DOI":"10.1098\/rsta.1993.0139"},{"key":"4_CR23","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 10.2) (2023). https:\/\/www.sagemath.org"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80308-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:02:59Z","timestamp":1733979779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80308-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9783031803079","9783031803086"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80308-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"18 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}