Generating hard instances of the short basis problem, ICALP, p.19, 1999. ,
Algorithmic Number Theory: Ecient Algorithms, vol.1, 1996. ,
New bounds in some transference theorems in the geometry of numbers, Mathematische Annalen, vol.296, issue.4, p.625636, 1993. ,
Computing generator in cyclotomic integer rings, Eurocrypt, p.6088, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01518438
Subexponential class group and unit group computation in large degree number elds, LMS Journal of Computation and Mathematics, vol.17, p.385403, 2014. ,
A polynomial time quantum algorithm for computing class groups and solving the principal ideal problem in arbitrary degree number elds, SODA, 2016. ,
Random self-reducibility of ideal-SVP via Arakelov random walks, CRYPTO, p.243272, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02513308
Calculating the power residue symbol and ibeta, ISSAC, vol.68, p.923934, 2017. ,
Heuristics for class numbers of prime-power real cyclotomic elds ,
, High primes and misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, p.149157, 2004.
Soliloquy: A cautionary tale, ETSI 2nd Quantum-Safe Crypto Workshop, 2014. ,
Recovering short generators of principal ideals in cyclotomic rings, Eurocrypt, p.559585, 2016. ,
Short stickelberger class relations and application to ideal-svp, Eurocrypt, p.324348, 2017. ,
Principles of Harmonic Analysis, 2016. ,
On a question of lehmer and the number of irreducible factors of a polynomial, Acta Arithmetica, vol.34, issue.4, p.391401, 1979. ,
On the shortness of vectors to be found by the ideal-svp quantum algorithm, CRYPTO, p.322351, 2019. ,
A quantum algorithm for computing the unit group of an arbitrary degree number eld, STOC, p.293302, 2014. ,
A fully homomorphic encryption scheme, 2009. ,
Fully homomorphic encryption using ideal lattices, STOC, p.169178, 2009. ,
Toward basing fully homomorphic encryption on worst-case hardness, CRYPTO, p.116137, 2010. ,
Trapdoors for hard lattices and new cryptographic constructions, STOC, p.197206, 2008. ,
Explicit versions of the prime ideal theorem for dedekind zeta functions under grh, Mathematics of Computation, vol.85, issue.298, p.889906, 2015. ,
Analytic Number Theory, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00180743
Expander graphs based on GRH with an application to elliptic curve cryptography, Journal of Number Theory, 2009. ,
On graphs of isogenies of principally polarizable abelian surfaces and the discrete logarithm problem, 2015. ,
On the minimum of the unit lattice, vol.3, p.377380, 1991. ,
Finding the closest lattice vector when it's unusually close, SODA, p.937941, 2000. ,
An lll algorithm for module lattices, Asiacrypt, p.5990 ,
URL : https://hal.archives-ouvertes.fr/hal-02397335
, , 2019.
Explicit bounds for residues of dedekind zeta functions, values of l-functions at s=1, and relative class numbers, Journal of Number Theory, 2000. ,
Generalized compact knapsacks are collision resistant, ICALP, p.144155, 2006. ,
On ideal lattices and learning with errors over rings, Journal of the ACM, vol.60, issue.6, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00921792
Generalized compact knapsacks, cyclic lattices, and ecient one-way functions, Computational Complexity, vol.16, issue.4, p.365411, 2002. ,
Worst-case to average-case reductions based on gaussian measures, SIAM J. Comput, vol.37, issue.1, p.267302, 2007. ,
Real cyclotomic elds of prime conductor and their class numbers, Math. Comp, vol.84, issue.295, p.24592469, 2015. ,
, Generalizations of Banaszczyk's transference theorems and tail bound, 2018.
, Gesammelte Abhandlungen, 1967.
, Modular Forms. Springer Monographs in Mathematics, 2006.
Algebraic number theory, vol.322, 2013. ,
Algebraic Number Theory. Grundlehren der mathematischen Wissenschaften, 2013. ,
Ecient collision-resistant hashing from worst-case assumptions on cyclic lattices, TCC, p.145166, 2006. ,
Approx-svp in ideal lattices with pre-processing, Eurocrypt, p.685716, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02139939
On lattices, learning with errors, random linear codes, and cryptography, J. ACM, vol.56, issue.6, p.140, 2005. ,
Computing arakelov class groups, Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, p.447495, 2008. ,
A new polynomial factorization algorithm and its implementation, Journal of Symbolic Computation, vol.20, issue.4, pp.363-397, 1995. ,
Ecient public key encryption based on ideal lattices, ASIACRYPT, p.617635, 2009. ,
Factoring polynomials over nite elds: A survey, Journal of Symbolic Computation, vol.31, issue.1, pp.3-17, 2001. ,
Introduction to cyclotomic elds, vol.83, 2012. ,
Arithmetic and geometric structures in cryptography, vol.11, 2018. ,