{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:05:01Z","timestamp":1777287901695,"version":"3.51.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159787","type":"print"},{"value":"9783031159794","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15979-4_17","type":"book-chapter","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T16:25:31Z","timestamp":1665591931000},"page":"480-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Some Easy Instances of\u00a0Ideal-SVP and\u00a0Implications on\u00a0the\u00a0Partial Vandermonde Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Katharina","family":"Boudgoust","sequence":"first","affiliation":[]},{"given":"Erell","family":"Gachon","sequence":"additional","affiliation":[]},{"given":"Alice","family":"Pellet-Mary","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-70694-8_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"MR Albrecht","year":"2017","unstructured":"Albrecht, M.R., Deo, A.: Large modulus ring-LWE $$\\ge $$ module-LWE. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 267\u2013296. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_10"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lov\u00e1sz\u2019lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Boudgoust, K., Gachon, E., Pellet-Mary, A.: Some easy instances of ideal-SVP and implications on the partial Vandermonde Knapsack problem. Cryptology ePrint Archive, Paper 2022\/709 (2022)","DOI":"10.1007\/978-3-031-15979-4_17"},{"key":"17_CR5","doi-asserted-by":"crossref","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 (2021)","DOI":"10.1007\/978-3-031-22969-5_23"},{"key":"17_CR6","unstructured":"Boudgoust, K.: Theoretical hardness of algebraically structured learning with errors. Ph.D. thesis, Universite Rennes 1 (2021). https:\/\/tel.archives-ouvertes.fr\/tel-03534254\/document"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-64834-3_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"O Bernard","year":"2020","unstructured":"Bernard, O., Roux-Langlois, A.: Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 349\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_12"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Boudgoust, K., Sakzad, A., Steinfeld, R.: Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems. Cryptology ePrint Archive, Report 2022\/679 (2022)","DOI":"10.1007\/s10623-022-01083-7"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-49896-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Cramer","year":"2016","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3431725","volume":"68","author":"R Cramer","year":"2021","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. J. ACM (JACM) 68(2), 1\u201326 (2021)","journal-title":"J. ACM (JACM)"},{"key":"17_CR11","unstructured":"Conrad, K.: The different ideal. https:\/\/kconrad.math.uconn.edu\/blurbs\/gradnumthy\/different.pdf. Accessed 16 Feb 2022"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-56880-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"K de Boer","year":"2020","unstructured":"de Boer, K., Ducas, L., Pellet-Mary, A., Wesolowski, B.: Random self-reducibility of ideal-SVP via Arakelov random walks. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 243\u2013273. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_9"},{"key":"17_CR13","unstructured":"Dor\u00f6z, Y., Hoffstein, J., Silverman, J.H., Sunar, B.: MMSAT: a scheme for multimessage multiuser signature aggregation. Cryptology ePrint Archive, Report 2020\/520 (2020)"},{"key":"17_CR14","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). http:\/\/crypto.stanford.edu\/craig"},{"key":"17_CR15","unstructured":"Hoffstein, J., Kaliski, B.S., Jr., Lieman, D.B., Robshaw, M.J.B., Yin, Y.L.: Secure user identification based on constrained polynomials, 13 June 2000. US Patent 6,076,163. Filed 20 October 1997"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-319-07536-5_28","volume-title":"Applied Cryptography and Network Security","author":"J Hoffstein","year":"2014","unstructured":"Hoffstein, J., Pipher, J., Schanck, J.M., Silverman, J.H., Whyte, W.: Practical signatures from the partial Fourier recovery problem. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 476\u2013493. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_28"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10623-015-0089-z","volume":"77","author":"J Hoffstein","year":"2015","unstructured":"Hoffstein, J., Silverman, J.H.: Pass-encrypt: a public key cryptosystem based on partial evaluation of polynomials. Des. Codes Crypt. 77(2), 541\u2013552 (2015)","journal-title":"Des. Codes Crypt."},{"key":"17_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S Lang","year":"2002","unstructured":"Lang, S.: Algebra. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-1-4613-0041-0"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact Knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144\u2013155. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_13"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"issue":"3","key":"17_CR23","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/978-3-319-93638-3_50","volume-title":"Information Security and Privacy","author":"X Lu","year":"2018","unstructured":"Lu, X., Zhang, Z., Au, M.H.: Practical signatures from the partial Fourier recovery problem revisited: a provably-secure and Gaussian-distributed construction. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 813\u2013820. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_50"},{"key":"17_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9356-6","volume-title":"Number Fields","author":"DA Marcus","year":"1977","unstructured":"Marcus, D.A.: Number Fields, vol. 2. Springer, Heidelberg (1977). https:\/\/doi.org\/10.1007\/978-1-4684-9356-6"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: FOCS, pp. 356\u2013365. IEEE Computer Society (2002)","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78381-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"D Micciancio","year":"2018","unstructured":"Micciancio, D., Walter, M.: On the bit security of cryptographic primitives. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 3\u201328. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_1"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-030-17656-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Pellet-Mary","year":"2019","unstructured":"Pellet-Mary, A., Hanrot, G., Stehl\u00e9, D.: Approx-SVP in ideal lattices with pre-processing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 685\u2013716. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_24"},{"key":"17_CR29","unstructured":"Porter, C., Mendelsohn, A., Ling, C.: Subfield algorithms for ideal-and module-SVP based on the decomposition group. arXiv preprint arXiv:2105.03219 (2021)"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145\u2013166. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_8"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-030-77870-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"Y Pan","year":"2021","unstructured":"Pan, Y., Xu, J., Wadleigh, N., Cheng, Q.: On the ideal shortest vector problem over random rational primes. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 559\u2013583. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_20"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C-P Schnorr","year":"1994","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"17_CR35","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 9.0) (2020). https:\/\/www.sagemath.org"},{"key":"17_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0133-2","volume-title":"Introduction to Cyclotomic Fields","author":"LC Washington","year":"1982","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields, vol. 83. Springer, Berlin (1982). https:\/\/doi.org\/10.1007\/978-1-4684-0133-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15979-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:03:10Z","timestamp":1760220190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15979-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159787","9783031159794"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15979-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}