M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, Structure-Preserving Signatures and Commitments to Group Elements, Lecture Notes in Computer Science, vol.6223, pp.209-236, 2010.
DOI : 10.1007/978-3-642-14623-7_12

D. J. Bernstein and T. Lange, Faster Addition and Doubling on Elliptic Curves, Lecture Notes in Computer Science, vol.4833, pp.29-50, 2007.
DOI : 10.1007/978-3-540-76900-2_3

E. Bombieri, On Exponential Sums in Finite Fields, American Journal of Mathematics, vol.88, issue.1, pp.37-41, 1966.
DOI : 10.2307/2373048

D. Boneh and M. K. Franklin, Identity-Based Encryption from the Weil Pairing, Lecture Notes in Computer Science, vol.2139, pp.213-229, 2001.
DOI : 10.1007/3-540-44647-8_13

J. Cassels and E. Flynn, Prolegomena to a middlebrow arithmetic of curves of genus 2. Number 230 in London Mathematical Society Lecture Note Series, 1996.

M. Drmota and R. F. Tichy, Sequences, discrepancies and applications, 1997.
DOI : 10.1007/BFb0093404

R. R. Farashahi, Hashing into Hessian Curves, AFRICACRYPT, pp.278-289, 2011.
DOI : 10.1006/ffta.1997.0191
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.7529

R. R. Farashahi, P. Fouque, I. E. Shparlinski, M. Tibouchi, and J. F. Voloch, Indifferentiable deterministic hashing to elliptic and hyperelliptic curves, Mathematics of Computation, vol.82, issue.281, pp.491-512, 2013.
DOI : 10.1090/S0025-5718-2012-02606-8

P. Fouque and M. Tibouchi, Deterministic Encoding and Hashing to Odd Hyperelliptic Curves, Pairing, pp.265-277, 2010.
DOI : 10.1007/978-3-642-17455-1_17
URL : https://hal.archives-ouvertes.fr/inria-00556678

T. Icart, How to Hash into Elliptic Curves, Lecture Notes in Computer Science, vol.5677, pp.303-316, 2009.
DOI : 10.1007/978-3-642-03356-8_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5920

A. Joux and V. Vitse, Cover and decomposition index calculus on elliptic curves made practical Application to a previously unreachable curve over F p 6, Lecture Notes in Computer Science, vol.7237, 2012.

M. Joye, M. Tibouchi, and D. Vergnaud, Huff???s Model for Elliptic Curves, ANTS, pp.234-250, 2010.
DOI : 10.1007/978-3-642-14518-6_20

Y. Lindell, Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption, Lecture Notes in Computer Science, vol.6632, pp.446-466, 2011.
DOI : 10.1007/978-3-642-20465-4_25

U. M. Maurer, Abstract Models of Computation in Cryptography, IMA Int. Conf, pp.1-12, 2005.
DOI : 10.1007/11586821_1

J. Paulhus, Decomposing Jacobians of curves with extra automorphisms, Acta Arithmetica, vol.132, issue.3, pp.231-244, 2008.
DOI : 10.4064/aa132-3-3

A. Shallue and C. Van-de-woestijne, Construction of Rational Points on Elliptic Curves over Finite Fields, ANTS, pp.510-524, 2006.
DOI : 10.1007/11792086_36

V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, Lecture Notes in Computer Science, vol.1233, pp.256-266, 1997.
DOI : 10.1007/3-540-69053-0_18