Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6197 LNCS, Issue , 2010, Pages 285-300

  Nagao, Koh Ichi ^a  

^a KANTO GAKUIN UNIVERSITY   (Japan)

Author keywords

Decomposition Attack; Discrete logarithm problem; Hyperelliptic curve; Weil descent attack

Indexed keywords

COMPUTER ALGEBRA SYSTEMS; CONCRETE SYSTEM; DISCRETE LOGARITHM PROBLEMS; EXTENSION FIELD; HYPERELLIPTIC CURVE; JACOBIANS; MULTI-VARIABLE POLYNOMIALS; QUADRATIC EQUATIONS; REDUCED DIVISOR;

ALGEBRA; NUMBER THEORY;

PROBLEM SOLVING;

EID: 77955333479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14518-6_23     Document Type: Conference Paper

References (16)

1. Adleman, M., DeMarrais, J., Huang, M.-D.: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Huang, M.-D. A., Adleman, L. M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 28-40. Springer, Heidelberg (1994)
2. Cantor, D. G.: Computing in the Jacobian of hyperelliptic curve. Math. Comp. 48, 95-101 (1987)
3. Diem, C.: An Index Calculus Algorithm for Plane Curves of Small Degree. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 543-557. Springer, Heidelberg (2006)
4. Diem, C.: On the discrete logarithm problem in class groups (2009) (preprint), http://www.math.uni-leipzig.de/~diem/preprints/small-genus.pdf
5. Enge, A., Gaudry, P.: A general framework for subexponential discrete logarithm algorithms. Acta Arith. 102 (1), 83-103 (2002)
6. Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 19-34. Springer, Heidelberg (2000)
7. Gaudry, P., Thomé, E., Thériault, N., Diem, C.: A double large prime variation for small genus hyperelliptic decomposed attack. Math. Comp. 76, 475-492 (2007) Preprint Version, http://eprint.iacr.org/2004/153/
8. Gaudry, P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. Journal of Symbolic Computation 44 (12), 1690-1702 (2009), Preprint version http://eprint.iacr.org/2004/073
9. Hess, F.: Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symb. Comp. 11, 1-22 (2001)
10. Hindry, M., Silverman, J. H.: Diophantine Geometry An introduction. In: Graduate Texts in Math., vol. 201. Springer, Heidelberg (2000)
11. Granger, R., Vercauteren, F.: On the Discrete Logarithm Problem on Algebraic Tori. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 66-85. Springer, Heidelberg (2005)
12. LaMacchia, B. A., Odlyzko, A. M.: Solving large sparse linear systems over finite fields. In: Menezes, A., Vanstone, S. A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 109-133. Springer, Heidelberg (1991)
13. Nagao, K.: Index calculus for Jacobian of hyperelliptic curve of small genus using two large primes. Japan Journal of Industrial and Applied Mathematics 24 (3) (2007); Preprint version entitled by Improvement of Thériault Algorithm of decomposed attack for Jacobian of Hyperelliptic Curves of Small Genus, http://eprint.iacr.org/2004/161
14. Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves (2004) (preprint)
15. Thériault, N.: Index calculus for hyperelliptic curves of small genus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 75-92. Springer, Heidelberg (2003)
16. Wiedemann, D. H.: Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory IT-32 (1), 54-62 (1986)