메뉴 건너뛰기




Volumn 147, Issue 1, 2011, Pages 75-104

On the discrete logarithm problem in elliptic curves

Author keywords

discrete logarithm problem; elliptic curves

Indexed keywords


EID: 79957476584     PISSN: 0010437X     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0010437X10005075     Document Type: Article
Times cited : (56)

References (21)
  • 3
    • 85013342629 scopus 로고
    • Generalized characteristic polynomials
    • J. Canny, Generalized characteristic polynomials, J. Symbolic. Comput. 9(1990), 241-250.
    • (1990) J. Symbolic. Comput. , vol.9 , pp. 241-250
    • Canny, J.1
  • 5
    • 78649387333 scopus 로고    scopus 로고
    • On the discrete logarithm problem in class groups of curves
    • doi:10.1090/S0025-5718-2010-02281-1
    • C. Diem, On the discrete logarithm problem in class groups of curves. Math. Comp. (2009), doi:10.1090/S0025-5718-2010-02281-1.
    • (2009) Math. Comp.
    • Diem, C.1
  • 8
    • 69849107700 scopus 로고    scopus 로고
    • Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
    • P. Gaudry, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, J. Symbolic. Comput. 44(2009), 1690-1702.
    • (2009) J. Symbolic. Comput. , vol.44 , pp. 1690-1702
    • Gaudry, P.1
  • 12
    • 0000119243 scopus 로고
    • Idempotent relations and factors of Jacobians
    • E. Kani and M. Rosen, Idempotent relations and factors of Jacobians, Math. Ann. 284(1989), 307-327.
    • (1989) Math. Ann. , vol.284 , pp. 307-327
    • Kani, E.1    Rosen, M.2
  • 13
    • 84968513551 scopus 로고
    • A rigorous time bound for factoring integers
    • H. W. Lenstra and C. Pomerance, A rigorous time bound for factoring integers, J. Amer. Math. Soc. 5(1992), 483-516.
    • (1992) J. Amer. Math. Soc. , vol.5 , pp. 483-516
    • Lenstra, H.W.1    Pomerance, C.2
  • 15
    • 22144445920 scopus 로고    scopus 로고
    • The weil pairing, and its efficient calculation
    • DOI 10.1007/s00145-004-0315-8
    • V. Miller, The Weil pairing and its efficient computation, J. Cryptology 17(2004), 235-261. (Pubitemid 41201458)
    • (2004) Journal of Cryptology , vol.17 , Issue.4 , pp. 235-261
    • Miller, V.S.1
  • 16
    • 0001332639 scopus 로고    scopus 로고
    • Solving degenerate sparse polynomial systems faster
    • J. M. Rojas, Solving degenerate sparse polynomial systems faster, J. Symbolic. Comput. 28(1999), 155-186.
    • (1999) J. Symbolic. Comput. , vol.28 , pp. 155-186
    • Rojas, J.M.1
  • 17
    • 84972540003 scopus 로고
    • Approximate formulas for some functions of prime numbers
    • J. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6(1962), 64-94.
    • (1962) Illinois J. Math. , vol.6 , pp. 64-94
    • Rosser, J.1    Schoenfeld, L.2
  • 18
    • 84966233278 scopus 로고
    • Elliptic curves over finite fields and the compuation of square roots mod p
    • R. Schoof, Elliptic curves over finite fields and the compuation of square roots mod p, Math. Comp. 44(1985), 483-494.
    • (1985) Math. Comp. , vol.44 , pp. 483-494
    • Schoof, R.1


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