here - Sites personnels de TELECOM ParisTech - Télécom ParisTech

Bibliography[1] Milton Abramowitz and Irene Anne Stegun. Handbook of mathematical functions withformulas, graphs, and mathematical tables, volume 55 of National Bureau of StandardsApplied Mathematics Series. For sale by the Superintendent of Documents, U.S. GovernmentPrinting Office, Washington, D.C., 1964. (Cited on pages 67, 71, 74, and 77.)[2] Amod Agashe, Kristin Estella Lauter, and Ramarathnam Venkatesan. Constructing ellipticcurves with a known number of points over a prime field. In High primes and misdemeanours:lectures in honour of the 60th birthday of Hugh Cowie Williams, volume 41 of Fields Inst.Commun., pages 1–17. Amer. Math. Soc., Providence, RI, 2004. (Cited on page 153.)[3] Omran Ahmadi and Robert Granger. An efficient deterministic test for Kloosterman sumzeros. CoRR, abs/1104.3882, 2011. (Cited on pages 115, 120, 121, and 122.)[4] Abraham Adrian Albert. On the construction of Riemann matrices. I. Ann. of Math. (2),35(1):1–28, 1934. (Cited on page 168.)[5] Abraham Adrian Albert. A solution of the principal problem in the theory of Riemannmatrices. Ann. of Math. (2), 35(3):500–515, 1934. (Cited on page 168.)[6] Abraham Adrian Albert. Involutorial simple algebras and real Riemann matrices. Ann. ofMath. (2), 36(4):886–964, 1935. (Cited on page 168.)[7] Abraham Adrian Albert. On the construction of Riemann matrices. II. Ann. of Math. (2),36(2):376–394, 1935. (Cited on page 168.)[8] Jörg Arndt. Matters Computational: Ideas, Algorithms, Source Code. Springer, 2010. (Citedon pages 98, 122, and 232.)[9] Arthur Oliver Lonsdale Atkin and François Morain. Elliptic curves and primality proving.Math. Comp., 61(203):29–68, 1993. (Cited on page 152.)[10] Ramachandran Balasubramanian and Neal Koblitz. The improbability that an elliptic curvehas subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm.J. Cryptology, 11(2):141–145, 1998. (Cited on pages 155 and 156.)[11] Samuel Beckett. En attendant Godot : pièce en deux actes. Charles Massin et Cie, Editions,1952. (Cited on pages xi and 218.)[12] Juliana Belding, Reinier Martijn Bröker, Andreas Enge, and Kristin Estella Lauter. ComputingHilbert class polynomials. In van der Poorten and Stein [271], pages 282–295. (Citedon page 153.)