{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:17:30Z","timestamp":1769314650124,"version":"3.49.0"},"publisher-location":"Cham","reference-count":46,"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_3","type":"book-chapter","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T02:29:18Z","timestamp":1490927358000},"page":"60-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Computing Generator in Cyclotomic Integer Rings"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Biasse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Espitau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"G\u00e9lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Kirchner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-48329-2_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 1993","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M., DeMarrais, J.: A Subexponential algorithm for discrete logarithms over all finite fields. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 147\u2013158. Springer, Heidelberg (1994). doi: 10.1007\/3-540-48329-2_13"},{"key":"3_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, 355\u2013380 (1990)","journal-title":"Math. Comput."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 10\u201324 (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.1090\/S0025-5718-2014-02651-3","volume":"83","author":"JF Biasse","year":"2014","unstructured":"Biasse, J.F.: An L(1\/3) algorithm for ideal class group and regulator computation in certain number fields. Math. Comput. 83, 2005\u20132031 (2014)","journal-title":"Math. Comput."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.3934\/amc.2014.8.407","volume":"8","author":"JF Biasse","year":"2014","unstructured":"Biasse, J.F.: Subexponential time relations in the class group of large degree number fields. Adv. Math. Commun. 8(4), 407\u2013425 (2014)","journal-title":"Adv. Math. Commun."},{"key":"3_CR6","unstructured":"Biasse, J.F.: A fast algorithm for finding a short generator of a principal ideal of $$\\mathbb{Q}(\\zeta _{2^n})$$ . arXiv:1503.03107v1 (2015)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Fieker, C.: Improved techniques for computing the ideal class group and a system of fundamental units in number fields. In: Proceedings of the 10th Algorithmic Number Theory Symposium (ANTS X) 2012, vol. 1, pp. 113\u2013133 (2012)","DOI":"10.2140\/obs.2013.1.113"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/S1461157014000345","volume":"17","author":"JF 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, 385\u2013403 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"3_CR9","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, SODA 2016, pp. 893\u2013902 (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1016\/j.laa.2009.08.012","volume":"432","author":"Y Bistritz","year":"2010","unstructured":"Bistritz, Y., Lifshitz, A.: Bounds for resultants of univariate and bivariate polynomials. Linear Algebra Appl. 432, 1995\u20132005 (2010)","journal-title":"Linear Algebra Appl."},{"key":"3_CR11","unstructured":"Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. S\u00e9minaire de Th\u00e9orie des Nombres, Paris 1988\u20131989, pp. 27\u201341 (1990)"},{"key":"3_CR12","unstructured":"Campbell, P., Groves, M., Shepherd, D.: SOLILOQUY: a cautionary tale. In: ETSI 2nd Quantum-Safe Crypto Workshop (2014). http:\/\/docbox.etsi.org\/workshop\/2014\/201410_CRYPTO\/S07_Systems_and_Attacks\/S07_Groves.pdf"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"ER Canfield","year":"1983","unstructured":"Canfield, E.R., Erd\u0151s, P., Pomerance, C.: On a problem of Oppenheim concerning \u2018factorisatio numerorum\u2019. J. Number Theory 17, 1\u201328 (1983)","journal-title":"J. Number Theory"},{"key":"3_CR14","unstructured":"Cheon, J.H., Lee, C.: Approximate algorithms on lattices with small determinant. Cryptology ePrint Archive, Report 2015\/461 (2015). http:\/\/eprint.iacr.org\/2015\/461"},{"key":"3_CR15","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol. 138. Springer, New York (1993)"},{"key":"3_CR16","unstructured":"Computational Algebra Group, University of Sydney: MAGMA, version 2.22.2 (2016). http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"3_CR17","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: 10.1007\/978-3-662-49896-5_20"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01459082","volume":"40","author":"JD Dixon","year":"1982","unstructured":"Dixon, J.D.: Exact solution of linear equations using $$p$$ -adic expansions. Numer. Math. 40, 137\u2013141 (1982)","journal-title":"Numer. Math."},{"key":"3_CR19","unstructured":"The FPLLL development team: fplll, version 5.0 (2016). https:\/\/github.com\/fplll\/fplll"},{"key":"3_CR20","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: 10.1007\/978-3-642-38348-9_1"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR22","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: 10.1007\/3-540-46035-7_20"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"JL Hafner","year":"1989","unstructured":"Hafner, J.L., McCurley, K.S.: A rigorous subexponential algorithm for computation of class groups. J. Am. Math. Soc. 2, 839\u2013850 (1989)","journal-title":"J. Am. Math. Soc."},{"key":"3_CR24","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: 10.1007\/BFb0054868"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 326\u2013344. Springer, Heidelberg (2006). doi: 10.1007\/11818175_19"},{"key":"3_CR26","unstructured":"Kirchner, P.: Algorithms on ideal over complex multiplication order. Cryptology ePrint Archive, Report 2016\/220 (2016). http:\/\/eprint.iacr.org\/2016\/220"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/BF01444310","volume":"56","author":"E Landau","year":"1903","unstructured":"Landau, E.: Neuer beweis des primzahlsatzes und beweis des primidealsatzes. Math. Ann. 56, 645\u2013670 (1903)","journal-title":"Math. Ann."},{"key":"3_CR28","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: 10.1007\/978-3-642-55220-5_14"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 564\u2013572 (1990)","DOI":"10.1145\/100216.100295"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-662-44371-2_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"HW Lenstra","year":"2014","unstructured":"Lenstra, H.W., Silverberg, A.: Revisiting the Gentry-Szydlo algorithm. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 280\u2013296. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44371-2_16"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: a modest proposal for FFT hashing. In: Fast Software Encryption, FSE 2008, pp. 54\u201372 (2008)","DOI":"10.1007\/978-3-540-71039-4_4"},{"issue":"6","key":"3_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 1\u201323 (2013)","journal-title":"J. ACM"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38348-9_3"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS 2002, pp. 356\u2013365 (2002)","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-662-49890-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Micciancio","year":"2016","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49890-3_31"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Warinschi, B.: A linear space algorithm for computing the Hermite normal form. In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, pp. 231\u2013236 (2001)","DOI":"10.1145\/384101.384133"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"381","DOI":"10.4064\/aa164-4-4","volume":"164","author":"JC Miller","year":"2014","unstructured":"Miller, J.C.: Class numbers of totally real fields and applications to the Weber class number problem. Acta Arith. 164, 381\u2013397 (2014)","journal-title":"Acta Arith."},{"key":"3_CR38","unstructured":"The PARI Group, Bordeaux: PARI\/GP, version 2.7.6 (2016). http:\/\/pari.math.u-bordeaux.fr\/"},{"key":"3_CR39","unstructured":"Schank, J.: LOGCVP, Pari implementation of CVP in $$\\log \\mathbb{Z}[\\zeta _{2^n}]^*$$ (2015). https:\/\/github.com\/jschanck-si\/logcvp"},{"issue":"3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"733","DOI":"10.5802\/jtnb.468","volume":"16","author":"E Scourfield","year":"2004","unstructured":"Scourfield, E.: On ideals free of large prime factors. J. Th\u00e9orie Nombres Bordx. 16(3), 733\u2013772 (2004)","journal-title":"J. Th\u00e9orie Nombres Bordx."},{"key":"3_CR41","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1090\/S0025-5718-1987-0878705-X","volume":"84","author":"M Seysen","year":"1987","unstructured":"Seysen, M.: A probabilistic factorization algorithm with quadratic forms of negative discriminant. Math. Comput. 84, 757\u2013780 (1987)","journal-title":"Math. Comput."},{"key":"3_CR42","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory, version 9.11.0 (2016). http:\/\/www.shoup.net\/ntl\/"},{"key":"3_CR43","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: 10.1007\/978-3-642-13013-7_25"},{"key":"3_CR44","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: 10.1007\/978-3-642-10366-7_36"},{"key":"3_CR45","unstructured":"Thiel, C.: On the complexity of some problems in algorithmic algebraic number theory. Ph.D. thesis, Universit\u00e4t des Saarlandes (1995). https:\/\/www.cdc.informatik.tu-darmstadt.de\/reports\/reports\/Christoph_Thiel.diss.pdf"},{"key":"3_CR46","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1934-7","volume-title":"Introduction to Cyclotomic Fields","author":"LC Washington","year":"1997","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields. Graduate Texts in Mathematics, vol. 83, 2nd edn. Springer, New York (1997)","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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:52:23Z","timestamp":1750189943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56620-7_3"}},"subtitle":["A Subfield Algorithm for the Principal Ideal Problem in $$L_{|\\varDelta _\\mathbb {K}|}\\left( \\frac{1}{2}\\right) $$ and Application to the Cryptanalysis of a FHE Scheme"],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566191","9783319566207"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56620-7_3","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"}]}}