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

192 Bibliography[13] Elwyn Ralph Berlekamp, Victor Henry Rumsey, and Hannah Greenebaum Solomon. Onthe solution of algebraic equations over finite fields. Information and Control, 10:553–564,1967. (Cited on page 118.)[14] Jean Berstel and Michel Pocchiola. Average cost of Duval’s algorithm for generating Lyndonwords. Theor. Comput. Sci., 132(2):415–425, 1994. (Cited on page 89.)[15] Eli Biham, editor. Advances in Cryptology - EUROCRYPT 2003, International Conferenceon the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8,2003, Proceedings, volume 2656 of Lecture Notes in Computer Science. Springer, 2003.(Cited on pages 195 and 202.)[16] Christina Birkenhake and Herbert Lange. Complex abelian varieties, volume 302 ofGrundlehren der Mathematischen Wissenschaften [Fundamental Principles of MathematicalSciences]. Springer-Verlag, Berlin, second edition, 2004. (Cited on pages 160, 162, 165, 166,and 167.)[17] Gaëtan Bisson. On the generation of pairing-friendly elliptic curves. Master’s thesis,Université Paris-Sud 11, 2007. http://www.normalesup.org/~bisson/res/memm2.pdf.(Cited on page 157.)[18] Ian Fraser Blake, Gadiel Seroussi, and Nigel Paul Smart. Elliptic curves in cryptography,volume 265 of London Mathematical Society Lecture Note Series. Cambridge UniversityPress, Cambridge, 2000. Reprint of the 1999 original. (Cited on pages 99, 103, 105, 154,and 155.)[19] Ian Fraser Blake, Gadiel Seroussi, and Nigel Paul Smart, editors. Advances in elliptic curvecryptography, volume 317 of London Mathematical Society Lecture Note Series. CambridgeUniversity Press, Cambridge, 2005. (Cited on pages 136, 137, 138, and 155.)[20] Dan Boneh and Matthew Keith Franklin. Identity-based encryption from the Weil pairing.In Joe Kilian, editor, CRYPTO, volume 2139 of Lecture Notes in Computer Science, pages213–229. Springer, 2001. (Cited on page 156.)[21] Dan Boneh and Matthew Keith Franklin. Identity-based encryption from the Weil pairing.SIAM J. Comput., 32(3):586–615, 2003. (Cited on page 156.)[22] Jorge Luis Borges. Ficciones. Works. Emecé Editores, 1973. (Cited on page 109.)[23] Wieb Bosma, John Cannon, and Catherine Playoust. The Magma algebra system. I. Theuser language. J. Symbolic Comput., 24(3-4):235–265, 1997. Computational algebra andnumber theory (London, 1993). (Cited on page 2.)[24] Robert Bradshaw, Craig Citro, and Dag Sverre Seljebotn. Cython: the best of both worlds.CiSE 2011 Special Python Issue, page 25, 2010. (Cited on pages 2 and 126.)[25] Johannes Franciscus Brakenhoff. Counting problems for number rings. PhD thesis, UniversiteitLeiden, 2009. (Cited on pages 169 and 170.)[26] Richard Peirce Brent, Pierrick Gaudry, Emmanuel Thomé, and Paul Zimmermann. Fastermultiplication in GF(2)[x]. In van der Poorten and Stein [271], pages 153–166. (Cited onpage 126.)[27] Reinier Martijn Bröker. Constructing elliptic curves of prescribed order. PhD thesis,Universiteit Leiden, 2006. (Cited on page 153.)