{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:03:50Z","timestamp":1780502630428,"version":"3.54.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319566191","type":"print"},{"value":"9783319566207","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56620-7_12","type":"book-chapter","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T02:29:18Z","timestamp":1490927358000},"page":"324-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":66,"title":["Short Stickelberger Class Relations and Application to Ideal-SVP"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L\u00e9o","family":"Ducas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Wesolowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1\u20139. Springer, Heidelberg (1999). doi:\n                      10.1007\/3-540-48523-6_1"},{"issue":"191","key":"12_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E Bach","year":"1990","unstructured":"Bach, E.: Explicit bounds for primality testing and related problems. Math. Comput. 55(191), 355\u2013380 (1990)","journal-title":"Math. Comput."},{"key":"12_CR3","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime. Cryptology ePrint Archive, Report 2016\/461 (2016). \n                      http:\/\/eprint.iacr.org\/2016\/461"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-319-56620-7_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J-F Biasse","year":"2017","unstructured":"Biasse, J.-F., Espitau, T., Fouque, P.-A., G\u00e9lin, A., Kirchner, P.: Computing generator in cyclotomic integer rings, a subfield algorithm for the principal ideal problem in L(1\/2) and application to cryptanalysis of a FHE scheme. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 60\u201388. Springer, Cham (2017)"},{"issue":"suppl. A","key":"12_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/S1461157014000345","volume":"17","author":"J-F Biasse","year":"2014","unstructured":"Biasse, J.-F., Fieker, C.: Subexponential class group and unit group computation in large degree number fields. LMS J. Comput. Math. 17(suppl. A), 385\u2013403 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Buhler, J., Pomerance, C., Robertson, L.: Heuristics for class numbers of prime-power real cyclotomic fields. In: High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications, pp. 149\u2013157. American Mathematical Society (2004)","DOI":"10.1090\/fic\/041\/12"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 893\u2013902. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-22792-9_29"},{"key":"12_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). doi:\n                      10.1007\/978-3-662-49896-5_20"},{"key":"12_CR10","unstructured":"Campbell, P., Groves, M., Shepherd, D.: Soliloquy: a cautionary tale. ETSI 2nd Quantum-Safe Crypto Workshop (2014). \n                      http:\/\/docbox.etsi.org\/Workshop\/2014\/201410_CRYPTO\/S07_Systems_and_Attacks\/S07_Groves_Annex.pdf"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46800-5_24"},{"key":"12_CR12","unstructured":"Eisentr\u00e4ger, K., Hallgren, S.: Algorithms for ray class groups and hilbert class fields. In: Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 471\u2013483. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2010). ISBN 978-0-898716-98-6"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A., Song, F.: A quantum algorithm for computing the unit group of an arbitrary degree number field. In: STOC, pp. 293\u2013302. ACM (2014)","DOI":"10.1145\/2591796.2591860"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-38348-9_1"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within mordell\u2019s inequality. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-46035-7_20","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"C Gentry","year":"2002","unstructured":"Gentry, C., Szydlo, M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 299\u2013320. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-46035-7_20"},{"key":"12_CR17","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). doi:\n                      10.1007\/BFb0054868"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Jao, D., Miller, S.D., Venkatesan, R.: Expander graphs based on GRH with an application to elliptic curve cryptography. J. Number Theory 129(6), 1491\u20131504 (2009). \n                      http:\/\/dx.doi.org\/10.1016\/j.jnt.2008.11.006\n                      \n                    . ISSN 0022\u2013314X","DOI":"10.1016\/j.jnt.2008.11.006"},{"key":"12_CR19","unstructured":"Jetchev, D., Wesolowski, B.: On graphs of isogenies of principally polarizable abelian surfaces and the discrete logarithm problem. CoRR, abs\/1506.00522 (2015)"},{"key":"12_CR20","unstructured":"Kirchner, P., Fouque, P.-A.: Comparison between subfield and straightforward attacks on NTRU. Cryptology ePrint Archive, Report 2016\/717 (2016). \n                      http:\/\/eprint.iacr.org\/2016\/717"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1112\/jlms\/s2-10.4.457","volume":"10","author":"HW Lenstra Jr","year":"1975","unstructured":"Lenstra Jr., H.W.: Euclid\u2019s algorithm in cyclotomic fields. J. Lond. Math. Soc 10, 457\u2013465 (1975)","journal-title":"J. Lond. Math. Soc"},{"issue":"4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"12_CR23","first-page":"144","volume":"2","author":"V Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. ICALP 2, 144\u2013155 (2006)","journal-title":"ICALP"},{"issue":"6","key":"12_CR24","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices, learning with errors over rings. J. ACM 60(6), 43:1\u201343:35 (2013). Preliminary version in Eurocrypt 2010","journal-title":"J. ACM"},{"issue":"3","key":"12_CR25","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. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-55220-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D., Steinfeld, R.: GGHLite: more efficient multilinear maps from ideal lattices. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 239\u2013256. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-642-55220-5_14"},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16(4), 365\u2013411 (2007). Preliminary version in FOCS 2002","journal-title":"Comput. Complex."},{"issue":"295","key":"12_CR28","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1090\/S0025-5718-2015-02924-X","volume":"84","author":"JC Miller","year":"2015","unstructured":"Miller, J.C.: Real cyclotomic fields of prime conductor and their class numbers. Math. Comp. 84(295), 2459\u20132469 (2015)","journal-title":"Math. Comp."},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.5802\/jtnb.176","volume":"8","author":"H Napias","year":"1996","unstructured":"Napias, H.: A generalization of the LLL-algorithm over euclidean rings or orders. J. Th\u00e9or. nombres Bordx. 8(2), 387\u2013396 (1996)","journal-title":"J. Th\u00e9or. nombres Bordx."},{"key":"12_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). doi:\n                      10.1007\/11681878_8"},{"issue":"6","key":"12_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009). Preliminary version in STOC 2005","journal-title":"J. ACM"},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C-P Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR33","volume-title":"The Structure of the Minus Class Groups of Abelian Number Fields","author":"R Schoof","year":"1989","unstructured":"Schoof, R.: The Structure of the Minus Class Groups of Abelian Number Fields. Rijksuniversiteit Utrecht, Mathematisch Instituut, Netherlands (1989)"},{"issue":"223","key":"12_CR34","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1090\/S0025-5718-98-00939-9","volume":"67","author":"R Schoof","year":"1998","unstructured":"Schoof, R.: Minus class groups of the fields of the \n                      \n                        \n                      \n                      \n$$\\ell $$\n\n                    -th roots of unity. Math. Comput. Am. Math. Soc. 67(223), 1225\u20131245 (1998)","journal-title":"Math. Comput. Am. Math. Soc."},{"issue":"242","key":"12_CR35","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1090\/S0025-5718-02-01432-1","volume":"72","author":"R Schoof","year":"2003","unstructured":"Schoof, R.: Class numbers of real cyclotomic fields of prime conductor. Math. Comput. 72(242), 913\u2013937 (2003)","journal-title":"Math. Comput."},{"key":"12_CR36","volume-title":"Catalan\u2019s Conjecture","author":"R Schoof","year":"2010","unstructured":"Schoof, R.: Catalan\u2019s Conjecture. Springer Science and Business Media, New York (2010)"},{"key":"12_CR37","unstructured":"Schank, J.: LogCvp, pari implementation of CVP in \n                      \n                        \n                      \n                      \n$$\\text{Log}\\mathbb{Z}[\\zeta _{2^{n}}]^*$$\n\n                     (2015). \n                      https:\/\/github.com\/jschanck-si\/logcvp"},{"issue":"5","key":"12_CR38","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). doi:\n                      10.1137\/S0097539795293172\n                      \n                    . ISSN 0097\u20135397","journal-title":"SIAM J. Comput."},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01389158","volume":"62","author":"W Sinnott","year":"1980","unstructured":"Sinnott, W.: On the Stickelberger ideal and the circular units of an abelian field. Invent. Math. 62, 181\u2013234 (1980)","journal-title":"Invent. Math."},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-20465-4_4"},{"key":"12_CR41","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). doi:\n                      10.1007\/978-3-642-10366-7_36"},{"key":"12_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"NP Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420\u2013443. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-13013-7_25"},{"key":"12_CR43","volume-title":"Introduction to Cyclotomic Fields","author":"LC Washington","year":"2012","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields, vol. 83, 2nd edn. Springer Science & Business Media, New York (2012)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56620-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T00:06:20Z","timestamp":1586477180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56620-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566191","9783319566207"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56620-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt2017.di.ens.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}