A. Becker, J. Coron, and A. Joux, Improved generic algorithms for hard knapsacks, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.364-385
URL : https://hal.archives-ouvertes.fr/hal-00664332

. Springer, , 2011.

J. Daniel, T. Bernstein, and . Lange, Computing small discrete logarithms faster, Progress in Cryptology -INDOCRYPT 2012, 13th International Conference on Cryptology in India, pp.317-338, 2012.

J. Daniel, T. Bernstein, and . Lange, Non-uniform cracks in the concrete: The power of free precomputation, Advances in Cryptology -ASIACRYPT 2013 -19th International Conference on the Theory and Application of Cryptology and Information Security, pp.321-340, 2013.

C. Delaplace and A. May, Can we beat the square root bound for ECDLP over F p 2 via representations? (NuTMiC) Number-Theoretic Methods in Cryptology, 2019.

P. Fouque, A. Joux, C. Mavromati, ;. Kaoshiung, and R. O. Taiwan, Multi-user collisions: Applications to discrete logarithm, even-mansour and PRINCE, Advances in Cryptology -ASIACRYPT 2014 -20th International Conference on the Theory and Application of Cryptology and Information Security, pp.420-438, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01213662

J. Faugère, L. Perret, C. Petit, and G. Renault, Improving the complexity of index calculus algorithms in elliptic curves over binary fields, Annual international conference on the theory and applications of cryptographic techniques, pp.27-44, 2012.

P. Gaudry, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Journal of Symbolic Computation, vol.44, issue.12, pp.1690-1702, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00337631

D. Steven, . Galbraith, W. Shishay, and . Gebregiyorgis, Summation polynomial algorithms for elliptic curves in characteristic two, International Conference on Cryptology in India, pp.409-427, 2014.

D. Steven, P. Galbraith, and . Gaudry, Recent progress on the elliptic curve discrete logarithm problem. Designs, Codes and Cryptography, vol.78, pp.51-72, 2016.

D. Steven, F. Galbraith, N. P. Hess, and . Smart, Extending the ghs weil descent attack, International Conference on the Theory and Applications of Cryptographic Techniques, pp.29-44, 2002.

P. Gaudry, F. Hess, and N. P. Smart, Constructive and destructive facets of weil descent on elliptic curves, Journal of Cryptology, vol.15, issue.1, pp.19-46, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00512763

D. Steven, N. P. Galbraith, and . Smart, A cryptographic application of weil descent, IMA International Conference on Cryptography and Coding, pp.191-200, 1999.

D. Steven, P. Galbraith, F. Wang, and . Zhang, Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm, Advances in Mathematics of Communications, vol.11, issue.3, 2017.

. N. Hgj10, A. Howgrave-graham, and . Joux, New generic algorithms for hard knapsacks, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.235-256, 2010.

Y. Huang, C. Petit, N. Shinohara, and T. Takagi, Improvement of faugere et al.'s method to solve ecdlp, International Workshop on Security, pp.115-132, 2013.

T. Kim and M. Tibouchi, Equidistribution among cosets of elliptic curve points in intervals, Number-Theoretic Methods in Cryptography (NutMic), 2019.

S. Kiran, C. Kedlaya, and . Umans, Fast polynomial factorization and modular composition, Computational Complexity of Discrete Problems, 2008.

F. Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th international symposium on symbolic and algebraic computation, pp.296-303, 2014.

M. Nüsken and M. Ziegler, Fast multipoint evaluation of bivariate polynomials, European Symposium on Algorithms, pp.544-555

. Springer, , 2004.

C. Petit, M. Kosters, and A. Messeng, Algebraic approaches for the elliptic curve discrete logarithm problem over prime fields, Public-Key Cryptography -PKC 2016 -19th IACR International Conference on Practice and Theory in Public-Key Cryptography, pp.3-18, 2016.

C. Petit and J. Quisquater, On polynomial systems arising from a weil descent, International Conference on the Theory and Application of Cryptology and Information Security, pp.451-466, 2012.

I. Semaev, Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation of the, vol.67, pp.353-356, 1998.

I. A. Semaev, Summation polynomials and the discrete logarithm problem on elliptic curves, IACR Cryptology ePrint Archive, p.31, 2004.

D. Shanks, Class number, a theory of factorization, and genera, Proc. of Symp, vol.20, pp.41-440, 1971.

G. Joris-van-der-hoeven and . Lecerf, Fast multivariate multi-point evaluation revisited, Journal of Complexity, p.101405, 2019.

M. J. Paul-c-van-oorschot and . Wiener, Parallel collision search with cryptanalytic applications, Journal of cryptology, vol.12, issue.1, pp.1-28, 1999.