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

202 Bibliography[161] Philippe Langevin, Nils-Gregor Leander, Gary Mcguire, and Eugen Zalinescu. Analysisof Kasami-Welch functions in odd dimension using Stickelberger’s theorem. Journal ofCombinatorics and Number Theory, 2(1):55 – 72, 2011. (Cited on page 21.)[162] Alan George Beattie Lauder. Deformation theory and the computation of zeta functions.Proc. London Math. Soc. (3), 88(3):565–602, 2004. (Cited on page 107.)[163] Alan George Beattie Lauder and Daqing Wan. Computing zeta functions of Artin-Schreiercurves over finite fields. LMS J. Comput. Math., 5:34–55, 2002. (Cited on page 107.)[164] Alan George Beattie Lauder and Daqing Wan. Computing zeta functions of Artin-Schreiercurves over finite fields II. J. Complexity, 20(2-3):331–349, 2004. (Cited on page 107.)[165] Alan George Beattie Lauder and Daqing Wan. Counting points on varieties over finite fieldsof small characteristic. In Algorithmic number theory: lattices, number fields, curves andcryptography, volume 44 of Math. Sci. Res. Inst. Publ., pages 579–612. Cambridge Univ.Press, Cambridge, 2008. (Cited on page 107.)[166] Kristin Estella Lauter and Damien Robert. About the CRT method to compute classpolynomials in dimension 2. Talk given at the "Journées Codage et Cryptographie 2011",slides available at http://www2.lirmm.fr/c2/programme.html, April 2011. (Cited onpage 184.)[167] Nils-Gregor Leander. Monomial bent functions. IEEE Transactions on Information Theory,52(2):738–743, 2006. (Cited on pages 110 and 111.)[168] John Marshall Lee. Introduction to smooth manifolds, volume 218 of Graduate Texts inMathematics. Springer-Verlag, New York, 2003. (Cited on page 161.)[169] Hendrik Willem Lenstra, Jr. Factoring integers with elliptic curves. Ann. of Math. (2),126(3):649–673, 1987. (Cited on page 153.)[170] Franck Leprévost, Michael Pohst, and Osmanbey Uzunkol. On the computation of classpolynomials with "thetanullwerte" and its applications to the unit group computation, 2009.To appear in Experimental Mathematics. (Cited on page 153.)[171] Reynald Lercier. Algorithmique des courbes elliptiques dans les corps finis. PhD thesis,École Polytechnique, June 1997. (Cited on page 107.)[172] Reynald Lercier and David Lubicz. Counting points on elliptic curves over finite fieldsof small characteristic in quasi quadratic time. In Biham [15], pages 360–373. (Cited onpage 107.)[173] Reynald Lercier and David Lubicz. A quasi quadratic time algorithm for hyperelliptic curvepoint counting. Ramanujan J., 12(3):399–423, 2006. (Cited on page 107.)[174] Reynald Lercier, David Lubicz, and Frederik Vercauteren. Point counting on elliptic andhyperelliptic curves. In Handbook of elliptic and hyperelliptic curve cryptography, DiscreteMath. Appl. (Boca Raton), pages 407–453. Chapman & Hall/CRC, Boca Raton, FL, 2006.(Cited on pages 107 and 121.)[175] Reynald Lercier and Christophe Ritzenthaler. Hyperelliptic curves and their invariants:geometric, arithmetic and algorithmic aspects. arXiv:1111.4152, November 2011. (Cited onpage 182.)