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

E. Andreas, How to distinguish hyperelliptic curves in even characteristic, Public-Key Cryptography and Computational Number Theory, de Gruyter Proceedings in Mathematics, pp.49-58, 2000.

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

J. W. Cassels, Lectures on elliptic curves, 1991.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.8553

H. Cohen, G. Frey, and R. Avanzi, Handbook of elliptic and hyperelliptic curve cryptography. Discrete mathematics and its applications, 2006.

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

J. Flori, S. Mesnager, and G. Cohen, The value 4 of binary kloosterman sums. Cryptology ePrint Archive, Report, vol.364, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00642290

S. Galbraith, Mathematics of Public Key Cryptography, 2011.
DOI : 10.1017/CBO9781139012843

P. Gaudry, Hyperelliptic Curves and the HCDLP, Advances in elliptic curve cryptography, pp.133-150, 2005.
DOI : 10.1017/CBO9780511546570.009
URL : https://hal.archives-ouvertes.fr/inria-00000626

F. Gologlu, Almost Bent and Almost Perfect Nonlinear Functions, Exponential Sums, Geometries and Sequences, 2009.

G. Gong and S. W. Golomb, Transform domain analysis of DES, IEEE Transactions on Information Theory, vol.45, issue.6, pp.2065-2073, 1999.
DOI : 10.1109/18.782138

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

D. Husemöller, Elliptic curves, volume 111 of Graduate Texts in Mathematics, 2004.

M. Jacobson, J. , A. Menezes, and A. Stein, Hyperelliptic curves and cryptography . In High primes and misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Inst. Commun, vol.41, pp.255-282, 2004.
DOI : 10.1090/fic/041/21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.7771

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.

A. W. Knapp, Elliptic curves, volume 40 of Mathematical Notes, 1992.

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

N. Koblitz, Algebraic aspects of cryptography, volume 3 of Algorithms and Computation in Mathematics With an appendix by, 1998.

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

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.

R. Lidl, G. L. Mullen, and G. Turnwald, Dickson polynomials, of Pitman Monographs and Surveys in Pure and Applied Mathematics. Longman Scientific & Technical, 1993.

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

P. Lison?k, Hyperbent functions and hyperelliptic curves Talk given at Arithmetic, Geometry, Cryptography and Coding Theory (AGCT-13), slides available at http://iml. univ-mrs.fr/~ritzenth/AGCT/talks/lisonek.pdf, 2011.

A. J. Menezes, Y. Wu, and R. J. Zuccherato, An elementary introduction to hyperelliptic curves, Algebraic aspects of cryptography, 1998.

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, Hyper-bent Boolean Functions with Multiple Trace Terms, Lecture Notes in Computer Science, vol.6087, pp.97-113, 2010.
DOI : 10.1007/978-3-642-13797-6_8

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

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

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

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. Lawrence and . Washington, Elliptic curves. Discrete Mathematics and its Applications (Boca Raton), 2008.

M. Amr, G. Youssef, and . Gong, Hyper-bent functions, Lecture Notes in Computer Science, vol.2045, pp.406-419, 2001.