O. Ahmadi and R. Granger, An efficient deterministic test for Kloosterman sum zeros. CoRR, abs/1104, 2011.

J. Arndt, Matters Computational: Ideas, Algorithms, Source Code, 2010.
DOI : 10.1007/978-3-642-14764-7

I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic curves in cryptography Lecture Note Series, 2000.

R. Bradshaw, C. Citro, and D. S. Seljebotn, Cython: the best of both worlds, CiSE Special Python Issue, p.25, 2010.

R. P. Brent, P. Gaudry, E. Thomé, and P. Zimmermann, Faster Multiplication in GF(2)[x], ANTS, pp.153-166, 2008.
DOI : 10.1007/978-3-540-79456-1_10
URL : https://hal.archives-ouvertes.fr/inria-00188261

C. Carlet, Boolean Functions for Cryptography and Error-Correcting Codes, Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp.257-397, 2010.
DOI : 10.1017/CBO9780511780448.011

P. Charpin and G. Gong, Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials, IEEE Transactions on Information Theory, vol.54, issue.9, pp.4230-4238, 2008.
DOI : 10.1109/TIT.2008.928273

P. Charpin, T. Helleseth, and V. Zinoviev, Divisibility properties of classical binary Kloosterman sums, Discrete Mathematics, vol.309, issue.12, pp.3975-3984, 2009.
DOI : 10.1016/j.disc.2008.11.010

S. Chee, S. Lee, and K. Kim, Semi-bent functions, Lecture Notes in Computer Science, vol.917, pp.107-118, 1994.
DOI : 10.1007/BFb0000428

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

A. David and . Cox, Primes of the form x 2 + ny 2, Fermat, class field theory and complex multiplication, 1989.

M. Deuring, Die Typen der Multiplikatorenringe elliptischer Funktionenk??rper, Abhandlungen aus dem Mathematischen Seminar der Universit??t Hamburg, vol.14, issue.1, pp.197-272, 1941.
DOI : 10.1007/BF02940746

J. Dumas, T. Gautier, P. Giorgi, J. Roch, and G. Villard, Givaro-3.2.13rc1: C++ library for arithmetic and algebraic computations, 2008.

A. Enge, Elliptic Curves and Their Applications to Cryptography: An Introduction, 1999.
DOI : 10.1007/978-1-4615-5207-9

M. Fouquet, P. Gaudry, and R. Harley, An extension of Satoh's algorithm and its implementation, Journal of the Ramanujan Mathematical Society, vol.15, pp.281-318, 2000.

R. Harley, Asymptotically optimal p-adic point-counting. Email to NMBRTHRY list, 2002.

T. Helleseth and V. Zinoviev, On linear Goethals codes and Kloosterman sums, Designs, Codes and Cryptography, vol.17, issue.1/3, pp.269-288, 1999.
DOI : 10.1023/A:1026491513009

N. Katz and R. Livné, Sommes de Kloosterman et courbes elliptiques universelles en caractéristiques 2 et 3, C. R. Acad. Sci. Paris Sér. I Math, vol.309, issue.11, pp.723-726, 1989.

N. Koblitz, Constructing Elliptic Curve Cryptosystems in Characteristic 2, Lecture Notes in Computer Science, vol.537, pp.156-167, 1990.
DOI : 10.1007/3-540-38424-3_11

G. Lachaud and J. Wolfmann, Sommes de Kloosterman, courbes elliptiques et codes cycliques en caractéristique 2, C. R. Acad. Sci. Paris Sér. I Math, vol.305, issue.20, pp.881-883, 1987.

G. Lachaud and J. Wolfmann, The weights of the orthogonals of the extended quadratic binary Goppa codes, IEEE Transactions on Information Theory, vol.36, issue.3, pp.686-692, 1990.
DOI : 10.1109/18.54892

S. Lang, Elliptic functions, volume 112 of Graduate Texts in Mathematics, 1987.

N. G. Leander, Monomial bent functions, IEEE Transactions on Information Theory, vol.52, issue.2, pp.738-743, 2006.
DOI : 10.1109/TIT.2005.862121
URL : https://hal.archives-ouvertes.fr/hal-01279295

R. Lercier, D. Lubicz, and F. Vercauteren, Point counting on elliptic and hyperelliptic curves In Handbook of elliptic and hyperelliptic curve cryptography, Discrete Math, Appl. (Boca Raton), pp.407-453, 2006.

P. Lisonek, On the Connection between Kloosterman Sums and Elliptic Curves, Lecture Notes in Computer Science, vol.5203, pp.182-187, 2008.
DOI : 10.1007/978-3-540-85912-3_17

S. Mesnager and I. Int, A New Family of Hyper-Bent Boolean Functions in Polynomial Form, Conf. Lecture Notes in Computer Science, vol.5921, pp.402-417, 2009.
DOI : 10.1007/978-3-642-10868-6_24

S. Mesnager, A new class of bent and hyper-bent Boolean functions in polynomial forms, Designs, Codes and Cryptography, vol.52, issue.7, pp.265-279, 2011.
DOI : 10.1007/s10623-010-9460-2

S. Mesnager, Semi-bent functions from Dillon and Niho exponents, Kloosterman sums and Dickson polynomials, IEEE Transactions on Information Theory

O. S. Rothaus, On ???bent??? functions, Journal of Combinatorial Theory, Series A, vol.20, issue.3, pp.300-305, 1976.
DOI : 10.1016/0097-3165(76)90024-8

T. Satoh, The canonical lift of an ordinary elliptic curve over a finite field and its point counting, J. Ramanujan Math. Soc, vol.15, issue.4, pp.247-270, 2000.

R. Schoof, Nonsingular plane cubic curves over finite fields, Journal of Combinatorial Theory, Series A, vol.46, issue.2, pp.183-211, 1987.
DOI : 10.1016/0097-3165(87)90003-3

V. Shoup, NTL 5.4.2: A library for doing number theory, 2008.

J. H. Silverman, The arithmetic of elliptic curves, Graduate Texts in Mathematics, vol.106, 1992.

W. A. Stein, The Sage Development Team, Sage Mathematics Software, 2011.

F. Vercauteren, Advances in Point Counting, Advances in elliptic curve cryptography, pp.103-132, 2005.
DOI : 10.1017/CBO9780511546570.008

F. Vercauteren, Computing zeta functions of curves over finite fields, 2003.

C. William and . Waterhouse, Abelian varieties over finite fields, Ann. Sci. École Norm. Sup, vol.2, issue.4, pp.521-560, 1969.

. Yeoh and . Gp, Pari implementation of point counting in characteristic 2

N. Y. , Y. , and G. Gong, Constructions of quadratic bent functions in polynomial forms, IEEE Transactions on Information Theory, vol.52, issue.7, pp.3291-3299, 2006.