메뉴 건너뛰기




Volumn 24, Issue 3, 2007, Pages 289-305

Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes

Author keywords

DLP; Hyperelliptic curve; Index calculus attack; Jacobian

Indexed keywords


EID: 38349014593     PISSN: 09167005     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03167541     Document Type: Article
Times cited : (7)

References (9)
  • 1
    • 84929727140 scopus 로고
    • A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields
    • Algorithmic Number Theory, ANTS-I, Springer-Verlag
    • M. Adleman, J. DeMarrais and M.-D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. Algorithmic Number Theory, ANTS-I, LNCS, 877, Springer-Verlag, 1994, 28-40.
    • (1994) LNCS , vol.877 , pp. 28-40
    • Adleman, M.1    DeMarrais, J.2    Huang, M.-D.3
  • 2
    • 33746706217 scopus 로고    scopus 로고
    • An Index Calculus Algorithm for Plane Curves of Small Degree
    • Algorithmic Number Theory-ANTS VII, Springer-Verlag
    • C. Diem, An Index Calculus Algorithm for Plane Curves of Small Degree. Algorithmic Number Theory-ANTS VII, LNCS, 4076, Springer-Verlag, 2006, 543-557.
    • (2006) LNCS , vol.4076 , pp. 543-557
    • Diem, C.1
  • 3
    • 0042833029 scopus 로고    scopus 로고
    • A general framework for subexponential discrete logarithm algorithms
    • A. Enge and P. Gaudry, A general framework for subexponential discrete logarithm algorithms. Acta Arith., 102 (2002), 83-103.
    • (2002) Acta Arith , vol.102 , pp. 83-103
    • Enge, A.1    Gaudry, P.2
  • 4
    • 84948978775 scopus 로고    scopus 로고
    • An algorithm for solving the discrete log problem on hyperelliptic curves
    • Springer-Verlag
    • P. Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves. Eurocrypt 2000, LNCS, 1807, Springer-Verlag, 2000, 19-34.
    • (2000) LNCS. Eurocrypt 2000 , vol.1807 , pp. 19-34
    • Gaudry, P.1
  • 5
    • 38049124867 scopus 로고    scopus 로고
    • A double large prime variation for small genus hyperelliptic index calculus
    • P. Gaudry, E. Thomé, Thériault and C. Diem, A double large prime variation for small genus hyperelliptic index calculus. Math. Comp., 76 (2007), 475-492.
    • (2007) Math. Comp , vol.76 , pp. 475-492
    • Gaudry, P.1    Thomé, E.2    Thériault3    Diem, C.4
  • 6
    • 33745149365 scopus 로고    scopus 로고
    • On the Discrete Logarithm Problem on Algebraic Tori
    • Advances in Cryptology, CRYPTO 2005, Springer-Verlag
    • R. Granger and F. Vercauteren, On the Discrete Logarithm Problem on Algebraic Tori. Advances in Cryptology, CRYPTO 2005, LNCS, 3621, Springer-Verlag, 2005, 66-85.
    • (2005) LNCS , vol.3621 , pp. 66-85
    • Granger, R.1    Vercauteren, F.2
  • 7
    • 84988216913 scopus 로고
    • Solving large sparse linear systems over finite fields
    • Crypto '90, Springer-Verlag
    • B.A. LaMacchia and A.M. Odlyzko, Solving large sparse linear systems over finite fields. Crypto '90, LNCS, 537, Springer-Verlag, 1990, 109-133.
    • (1990) LNCS , vol.537 , pp. 109-133
    • LaMacchia, B.A.1    Odlyzko, A.M.2
  • 8
    • 0345058968 scopus 로고    scopus 로고
    • Index calculus attack for hyperelliptic curves of small genus
    • Springer-Verlag
    • N. Thériault, Index calculus attack for hyperelliptic curves of small genus. ASIACRYPT 2003, LNCS, 2894, Springer-Verlag, 2003, 75-92.
    • (2003) LNCS. ASIACRYPT 2003 , vol.2894 , pp. 75-92
    • Thériault, N.1
  • 9
    • 0022583143 scopus 로고
    • Solving sparse linear equations over finite fields
    • D.H. Wiedemann, Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory, 32 (1986), 54-62.
    • (1986) IEEE Trans. Inform. Theory , vol.32 , pp. 54-62
    • Wiedemann, D.H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.