메뉴 건너뛰기
Discrete Mathematics and Applications
Volumn 13, Issue 1, 2003, Pages 27-50
On asymptotic complexity of computing discrete logarithms over GF(p)

(1)  Matyukhin, D V a  

a NONE
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0037267485     PISSN: 09249265     EISSN: None     Source Type: Journal    
DOI: 10.1163/156939203321669546     Document Type: Article
Times cited : (9)
References (12)
  • 1
    • 84884724395 scopus 로고    scopus 로고
    • A modification to the number field sieve for the problem of discrete logarithm in the field GF(p)
    • in Russian
    • D. V. Matyukhin and N. N. Murashov, A modification to the number field sieve for the problem of discrete logarithm in the field GF(p). Survey of Appl. and Industrial Math. (2000) 7, No. 2, 387-389 (in Russian).
    • (2000) Survey of Appl. and Industrial Math. , vol.7 , Issue.2 , pp. 387-389
    • Matyukhin, D.V.1    Murashov, N.N.2
  • 2
    • 0027610980 scopus 로고
    • Modifications to the number field sieve
    • D. Coppersmith, Modifications to the number field sieve. J. Cryptology (1993) 6, 169-180. (Pubitemid 23715718)
    • (1993) Journal of Cryptology , vol.6 , Issue.3 , pp. 169-180
    • Coppersmith, D.1
  • 3
    • 0001443138 scopus 로고
    • Discrete logarithms and local units
    • O. Schirokauer, Discrete logarithms and local units. Phil. Trans. Royal Soc. Lond. (1993) 345, 409-423.
    • (1993) Phil. Trans. Royal Soc. Lond. , vol.345 , pp. 409-423
    • Schirokauer, O.1
  • 6
    • 0000303380 scopus 로고
    • Discrete logarithms in GF(p) using the number field sieve
    • D. Gordon, Discrete logarithms in GF(p) using the number field sieve. SIAM J. Disc. Math. (1993) 6, 124-138.
    • (1993) SIAM J. Disc. Math. , vol.6 , pp. 124-138
    • Gordon, D.1
  • 7
    • 0001258323 scopus 로고
    • Factoring integers with elliptic curves
    • H. W. Lenstra, Factoring integers with elliptic curves. Ann. Math. (1987) 126, 649-673.
    • (1987) Ann. Math. , vol.126 , pp. 649-673
    • Lenstra, H.W.1
  • 8
    • 0003049266 scopus 로고
    • Heuristics on class groups of number fields
    • H. Cohen and H. W. Lenstra, Heuristics on class groups of number fields. Lect. Notes Math. (1984) 1068, 33-62.
    • (1984) Lect. Notes Math. , vol.1068 , pp. 33-62
    • Cohen, H.1    Lenstra, H.W.2
  • 9
    • 84988216913 scopus 로고
    • Solving large sparse linear systems over finite fields
    • B. LaMacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields. Lect. Notes Computer Sci. (1991) 537, 109-133.
    • (1991) Lect. Notes Computer Sci. , vol.537 , pp. 109-133
    • LaMacchia, B.1    Odlyzko, A.M.2
  • 10
    • 84919085619 scopus 로고
    • An improved algorithm for computing logarithms over GF(p) and its cryptographic significance
    • S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory (1978) 24, 106-110.
    • (1978) IEEE Trans. Inform. Theory , vol.24 , pp. 106-110
    • Pohlig, S.1    Hellman, M.2
  • 11
    • 84968515930 scopus 로고
    • Searching for primitive roots in finite fields
    • V. Shoup, Searching for primitive roots in finite fields. Math. Comp. (1992) 58, 369-380.
    • (1992) Math. Comp. , vol.58 , pp. 369-380
    • Shoup, V.1
  • 12
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients. Math. Ann. (1982) 261, 515-534.
    • (1982) Math. Ann. , vol.261 , pp. 515-534
    • Lenstra, A.K.1    Lenstra, H.W.2    Lovász, L.3

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