TY - JOUR AU - Brent, R. P. PY - 1980 DA - 1980// TI - An improved Monte Carlo factorization algorithm JO - BIT Numerical Mathematics VL - 20 UR - https://doi.org/10.1007/BF01933190 DO - 10.1007/BF01933190 ID - Brent1980 ER - TY - CHAP AU - Diem, C. ED - Hess, F. ED - Pauli, S. ED - Pohst, M. E. PY - 2006 DA - 2006// TI - An index calculus algorithm for plane curves of small degree BT - ANTS. Lecture Notes in Computer Science, vol 4076 PB - Springer CY - New York ID - Diem2006 ER - TY - JOUR AU - Diem, C. PY - 2011 DA - 2011// TI - On the discrete logarithm problem in elliptic curves JO - Compositio Mathematica VL - 147 UR - https://doi.org/10.1112/S0010437X10005075 DO - 10.1112/S0010437X10005075 ID - Diem2011 ER - TY - JOUR AU - Faugère, J. -. C. PY - 1999 DA - 1999// TI - A new efficient algorithm for computing Gröbner bases (F4) JO - Journal of Pure and Applied Algebra VL - 139 UR - https://doi.org/10.1016/S0022-4049(99)00005-5 DO - 10.1016/S0022-4049(99)00005-5 ID - Faugère1999 ER - TY - CHAP AU - Faugère, J. C. PY - 2002 DA - 2002// TI - A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) BT - Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation. ISSAC ’02 PB - ACM CY - New York, NY, USA ID - Faugère2002 ER - TY - JOUR AU - Faugère, J. C. AU - Gianni, P. AU - Lazard, D. AU - Mora, T. PY - 1993 DA - 1993// TI - Efficient computation of zero-dimensional Gröbner bases by change of ordering JO - Journal of Symbolic Computation VL - 16 UR - https://doi.org/10.1006/jsco.1993.1051 DO - 10.1006/jsco.1993.1051 ID - Faugère1993 ER - TY - CHAP AU - Faugère, J. -. C. AU - Perret, L. AU - Petit, C. AU - Renault, G. PY - 2012 DA - 2012// TI - Improving the complexity of index calculus algorithms in elliptic curves over binary field BT - Proceedings of Eurocrypt 2012. Lecture Notes in Computer Science, vol 7237 PB - Springer CY - London ID - Faugère2012 ER - TY - JOUR AU - Faugère, J. -. C. AU - Gaudry, P. AU - Huot, L. AU - Renault, G. PY - 2012 DA - 2012// TI - Using symmetries in the index calculus for elliptic curves discrete logarithm JO - IACR Cryptology ePrint Archive VL - 2012 ID - Faugère2012 ER - TY - JOUR AU - Gaudry, P. PY - 2009 DA - 2009// TI - Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem JO - Journal of Symbolic Computation VL - 44 UR - https://doi.org/10.1016/j.jsc.2008.08.005 DO - 10.1016/j.jsc.2008.08.005 ID - Gaudry2009 ER - TY - CHAP AU - Huang, Y. -. J. AU - Petit, C. AU - Shinohara, N. AU - Takagi, T. ED - Sakiyama, K. ED - Terada, M. PY - 2013 DA - 2013// TI - Improvement of Faugère et al.’s method to solve ECDLP BT - IWSEC. Lecture Notes in Computer Science, vol 8231 PB - Springer CY - New York ID - Huang2013 ER - TY - CHAP AU - Joux, A. AU - Vitse, V. ED - Kiayias, A. PY - 2011 DA - 2011// TI - A variant of the F4 algorithm BT - CT-RSA. Lecture Notes in Computer Science, vol 6558 PB - Springer CY - New York ID - Joux2011 ER - TY - JOUR AU - Joux, A. AU - Vitse, V. PY - 2013 DA - 2013// TI - Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields - Application to the Static Diffie-Hellman Problem on E(𝔽q5)$E(\mathbb {F}_{q^{5}})$ JO - J. Cryptology VL - 26 UR - https://doi.org/10.1007/s00145-011-9116-z DO - 10.1007/s00145-011-9116-z ID - Joux2013 ER - TY - CHAP AU - Joux, A. AU - Vitse, V. ED - Pointcheval, D. ED - Johansson, T. PY - 2012 DA - 2012// TI - Cover and decomposition index calculus on elliptic curves made practical - application to a previously unreachable curve over 𝔽p6$\mathbb {F}_{p^{6}}$ BT - EUROCRYPT. Lecture Notes in Computer Science, vol 7237 PB - Springer CY - New York ID - Joux2012 ER - TY - STD TI - National Security Agency: The Case for Elliptic Curve Cryptography (2009). https://www.nsa.gov/business/programs/elliptic_curve.shtml. UR - https://www.nsa.gov/business/programs/elliptic_curve.shtml ID - ref14 ER - TY - CHAP AU - Petit, C. AU - Quisquater, J. -. J. ED - Wang, X. ED - Sako, K. PY - 2012 DA - 2012// TI - On polynomial systems arising from a Weil descent BT - Advances in Cryptology - ASIACRYPT 2012. Lecture Notes in Computer Science, vol 7658 PB - Springer CY - New York ID - Petit2012 ER - TY - JOUR AU - Pollard, J. M. PY - 1975 DA - 1975// TI - A Monte Carlo method for factorization JO - BIT Numerical Mathematics VL - 15 UR - https://doi.org/10.1007/BF01933667 DO - 10.1007/BF01933667 ID - Pollard1975 ER - TY - JOUR AU - Pollard, J. M. PY - 2000 DA - 2000// TI - Kangaroos, monopoly and discrete logarithms JO - Journal of Cryptology VL - 13 UR - https://doi.org/10.1007/s001450010010 DO - 10.1007/s001450010010 ID - Pollard2000 ER - TY - JOUR AU - Semaev, I. PY - 2004 DA - 2004// TI - Summation polynomials and the discrete logarithm problem on elliptic curves JO - IACR Cryptology ePrint Archive VL - 2004 ID - Semaev2004 ER - TY - STD TI - Shanks, D.: Class number, a theory of factorization, and genera. In: 1969 Number Theory Institute (Proc. Sympos. Pure Math., Vol. XX, State Univ. New York, Stony Brook, N.Y., 1969), pp. 415–440, Providence, R.I. (1971). ID - ref19 ER - TY - CHAP AU - Shantz, M. AU - Teske, E. ED - Fischlin, M. ED - Katzenbeisser, S. PY - 2013 DA - 2013// TI - Solving the elliptic curve discrete logarithm problem using semaev polynomials, weil descent and gröbner basis methods - an experimental study BT - Number Theory and Cryptography. Lecture Notes in Computer Science, vol 8260 PB - Springer CY - New York ID - Shantz2013 ER -