L. M. Adleman and J. Demarrais, A subexponential algorithm for discrete logarithms over all finite fields, Advances in Cryptology -CRYPTO '93, Proceedings. pp, pp.147-158, 1993.
DOI : 10.2307/2152932

E. Bach, Explicit bounds for primality testing and related problems, Mathematics of Computation, vol.55, issue.191, pp.355-380, 1990.
DOI : 10.1090/S0025-5718-1990-1023756-8

A. Becker, L. Ducas, N. Gama, and T. Laarhoven, New directions in nearest neighbor searching with applications to lattice sieving, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.10-24, 2016.
DOI : 10.1137/1.9781611974331.ch2

J. F. Biasse, An $L(1/3)$ algorithm for ideal class group and regulator computation in certain number fields, Mathematics of Computation, vol.83, issue.288, pp.2005-2031, 2014.
DOI : 10.1090/S0025-5718-2014-02651-3
URL : https://hal.archives-ouvertes.fr/inria-00440223

J. F. Biasse, Subexponential time relations in the class group of large degree number fields, Advances in Mathematics of Communications, vol.8, issue.4, pp.407-425, 2014.
DOI : 10.3934/amc.2014.8.407

J. F. Biasse, A fast algorithm for finding a short generator of a principal ideal of Q(?2n )

J. F. Biasse and C. Fieker, Improved techniques for computing the ideal class group and a system of fundamental units in number fields, Proceedings of the 10th Algorithmic Number Theory Symposium (ANTS X) 2012, pp.113-133, 2012.
DOI : 10.2140/obs.2013.1.113

J. F. Biasse and C. Fieker, Abstract, LMS Journal of Computation and Mathematics, vol.17, issue.A, pp.385-403, 2014.
DOI : 10.1007/978-3-642-13013-7_25

J. F. Biasse and F. Song, Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.893-902, 2016.
DOI : 10.1137/1.9781611974331.ch64

Y. Bistritz and A. Lifshitz, Bounds for resultants of univariate and bivariate polynomials, Linear Algebra and its Applications, vol.432, issue.8, 1995.
DOI : 10.1016/j.laa.2009.08.012

J. Buchmann, A subexponential algorithm for the determination of class groups and regulators of algebraic number fields, pp.27-41, 1988.

P. Campbell, M. Groves, and D. Shepherd, SOLILOQUY: A cautionary tale. ETSI 2nd Quantum-Safe Crypto Workshop, CRYPTO/S07 _ Systems _ and _ Attacks/S07 _ Groves.pdf, 2014.

E. R. Canfield, P. Erd?s, and C. Pomerance, On a problem of Oppenheim concerning ???factorisatio numerorum???, Journal of Number Theory, vol.17, issue.1, pp.1-28, 1983.
DOI : 10.1016/0022-314X(83)90002-1

J. H. Cheon and C. Lee, Approximate algorithms on lattices with small determinant, Cryptology ePrint Archive, vol.461, p.461, 2015.

H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics, vol.138, 1993.
DOI : 10.1007/978-3-662-02945-9

R. Cramer, L. Ducas, C. Peikert, and O. Regev, Recovering Short Generators of Principal Ideals in Cyclotomic Rings, Advances in Cryptology -EUROCRYPT 2016. Proceedings, Part II, pp.559-585, 2016.
DOI : 10.1007/978-3-662-49896-5_20

J. D. Dixon, Exact solution of linear equations usingP-adic expansions, Numerische Mathematik, vol.82, issue.1, pp.137-141, 1982.
DOI : 10.1007/BF01459082

S. Garg, C. Gentry, and S. Halevi, Candidate Multilinear Maps from Ideal Lattices, Advances in Cryptology -EUROCRYPT 2013. Proceedings, pp.1-17, 2013.
DOI : 10.1007/978-3-642-38348-9_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6312

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009.
DOI : 10.1145/1536414.1536440
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.7592

C. Gentry and M. Szydlo, Cryptanalysis of the Revised NTRU Signature Scheme, Advances in Cryptology -EUROCRYPT 2002. Proceedings. pp, pp.299-320, 2002.
DOI : 10.1007/3-540-46035-7_20

J. L. Hafner and K. S. Mccurley, A rigorous subexponential algorithm for computation of class groups, Journal of the American Mathematical Society, vol.2, issue.4, pp.839-850, 1989.
DOI : 10.1090/S0894-0347-1989-1002631-0

J. Hoffstein, J. Pipher, and J. H. Silverman, NTRU: A ring-based public key cryptosystem, Algorithmic Number Theory, Third International Symposium, ANTS-III. Proceedings. pp, pp.267-288, 1998.
DOI : 10.1007/BFb0054868
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8422

A. Joux, R. Lercier, N. P. Smart, and F. Vercauteren, The Number Field Sieve in the Medium Prime Case, Advances in Cryptology -CRYPTO 2006, Proceedings. pp, pp.326-344, 2006.
DOI : 10.1007/11818175_19
URL : https://hal.archives-ouvertes.fr/hal-01102034

P. Kirchner, Algorithms on ideal over complex multiplication order. Cryptology ePrint Archive, Report, vol.2016220, p.220, 2016.

E. Landau, Neuer Beweis des Primzahlsatzes und Beweis des Primidealsatzes, Mathematische Annalen, vol.114, issue.4, pp.645-670, 1903.
DOI : 10.1007/BF01444310
URL : http://www.digizeitschriften.de/download/PPN235181684_0056/PPN235181684_0056___log45.pdf

A. Langlois, D. Stehlé, and R. Steinfeld, GGHLite: More Efficient Multilinear Maps from Ideal Lattices, Advances in Cryptology -EUROCRYPT 2014. Proceedings. pp, pp.239-256, 2014.
DOI : 10.1007/978-3-642-55220-5_14
URL : https://hal.archives-ouvertes.fr/hal-00983179

A. K. Lenstra, L. Jr, H. W. Manasse, M. S. Pollard, and J. M. , The number field sieve, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp.564-572, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00108061

H. W. Lenstra and A. Silverberg, Revisiting the Gentry-Szydlo Algorithm, Advances in Cryptology -CRYPTO 2014. Proceedings, Part I, pp.280-296, 2014.
DOI : 10.1007/978-3-662-44371-2_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.460.2142

V. Lyubashevsky, D. Micciancio, C. Peikert, and A. Rosen, SWIFFT: A Modest Proposal for FFT Hashing, Fast Software Encryption FSE, pp.54-72, 2008.
DOI : 10.1007/978-3-540-71039-4_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.4697

V. Lyubashevsky, C. Peikert, and O. Regev, On Ideal Lattices and Learning with Errors over Rings, Journal of the ACM, vol.60, issue.6, pp.1-23, 2013.
DOI : 10.1145/2535925
URL : https://hal.archives-ouvertes.fr/hal-00921792

V. Lyubashevsky, C. Peikert, and O. Regev, A Toolkit for Ring-LWE Cryptography, Advances in Cryptology -EUROCRYPT 2013. Proceedings. pp, pp.35-54, 2013.
DOI : 10.1007/978-3-642-38348-9_3
URL : https://hal.archives-ouvertes.fr/hal-00864284

D. Micciancio, Generalized compact knapsacks, cyclic lattices, and efficient oneway functions from worst-case complexity assumptions, 43rd Symposium on Foundations of Computer Science Proceedings. pp, pp.356-365, 2002.
DOI : 10.1109/sfcs.2002.1181960

D. Micciancio and M. Walter, Practical, Predictable Lattice Basis Reduction, Advances in Cryptology -EUROCRYPT 2016. Proceedings, Part I, pp.820-849, 2016.
DOI : 10.1007/978-3-662-49890-3_31

D. Micciancio and B. Warinschi, A linear space algorithm for computing the hermite normal form, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.231-236, 2001.
DOI : 10.1145/384101.384133

J. C. Miller, Class numbers of totally real fields and applications to the Weber class number problem, Acta Arithmetica, vol.164, issue.4, pp.381-397, 2014.
DOI : 10.4064/aa164-4-4

J. Schank, LOGCVP, Pari implementation of CVP in log Z[?2n ] * (2015), https

E. Scourfield, On ideals free of large prime factors, Journal de Th??orie des Nombres de Bordeaux, vol.16, issue.3, pp.733-772, 2004.
DOI : 10.5802/jtnb.468

M. Seysen, A probabilistic factorization algorithm with quadratic forms of negative discriminant, Mathematics of Computation, vol.48, issue.178, pp.757-780, 1987.
DOI : 10.1090/S0025-5718-1987-0878705-X

V. Shoup, NTL: A Library for doing Number Theory, version 9, 2016.

N. P. Smart and F. Vercauteren, Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes, Public Key Cryptography -PKC 2010. Proceedings. pp, pp.420-443, 2010.
DOI : 10.1007/978-3-642-13013-7_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.3315

D. Stehlé, R. Steinfeld, K. Tanaka, and K. Xagawa, Efficient Public Key Encryption Based on Ideal Lattices, Advances in Cryptology -ASIACRYPT 2009. Proceedings. pp, pp.617-635, 2009.
DOI : 10.1007/978-3-642-10366-7_36