메뉴 건너뛰기




Volumn 2247, Issue , 2001, Pages 108-116

A secure family of composite finite fields suitable for fast implementation of elliptic curve cryptography

Author keywords

Elliptic curve cryptography; Fast performance; Finite fields; Weil descent

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

EID: 84974687517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45311-3_11     Document Type: Conference Paper
Times cited : (13)

References (24)
  • 1
    • 84968494137 scopus 로고
    • Computing in the Jacobian of a Hyperelliptic Curve
    • D.G. Cantor. Computing in the Jacobian of a Hyperelliptic Curve. Mathematics of Computation, 48(177): 95-101, 1987.
    • (1987) Mathematics of Computation , vol.48 , Issue.177 , pp. 95-101
    • Cantor, D.G.1
  • 4
    • 0002286652 scopus 로고    scopus 로고
    • An Algorithm for Solving the Discrete Logarithm Problem on Hyperelliptic Curves
    • Springer-Verlag, editor, LNCS
    • P. Gaudry. An Algorithm for Solving the Discrete Logarithm Problem on Hyperelliptic Curves. In Springer-Verlag, editor, Advances in Cryptography - EUROCRYPT '2000, LNCS, 2000.
    • (2000) Advances in Cryptography - EUROCRYPT '2000
    • Gaudry, P.1
  • 5
    • 84945147855 scopus 로고    scopus 로고
    • Constructive and Destructive Facets of Weil Descent on Elliptic Curves
    • to appear
    • P. Gaudry, F. Hess, and N.P. Smart. Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Journal of Cryptology, to appear.
    • Journal of Cryptology
    • Gaudry, P.1    Hess, F.2    Smart, N.P.3
  • 6
    • 0000490812 scopus 로고    scopus 로고
    • A Survey of Fast Exponentiation Methods
    • D. M. Gordon. A Survey of Fast Exponentiation Methods. Journal of Algorithms, 27(1): 129-146, 1998.
    • (1998) Journal of Algorithms , vol.27 , Issue.1 , pp. 129-146
    • Gordon, D.M.1
  • 7
    • 0038670954 scopus 로고    scopus 로고
    • Software Implementation of Elliptic Curve Cryptography over Binary Fields
    • D. Hankerson, J. L. Hernandez, and A. Menezes. Software Implementation of Elliptic Curve Cryptography over Binary Fields. Proceedings of CHES2000, pages 1-24, 2000.
    • (2000) Proceedings of CHES2000 , pp. 1-24
    • Hankerson, D.1    Hernandez, J.L.2    Menezes, A.3
  • 8
    • 84897987451 scopus 로고
    • On Artin’s Conjecture
    • C. Hooley. On Artin’s Conjecture. J. Reine Angew. Math., 225: 209-220, 1967.
    • (1967) J. Reine Angew. Math. , vol.225 , pp. 209-220
    • Hooley, C.1
  • 10
    • 84968503742 scopus 로고
    • Elliptic Curve Cryptosystems
    • K. Koblitz. Elliptic Curve Cryptosystems. Mathematics of Computation, 48(177): 203-209, 1987.
    • (1987) Mathematics of Computation , vol.48 , Issue.177 , pp. 203-209
    • Koblitz, K.1
  • 11
    • 85024567680 scopus 로고
    • CM-curves with good cryptographic properties
    • Joan Feigenbaum, editor, Berlin, Springer-Verlag. Lecture Notes in Computer Science
    • N. Koblitz. CM-curves with good cryptographic properties. In Joan Feigenbaum, editor, Advances in Cryptology - Crypto '91, pages 279-287, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576.
    • (1991) Advances in Cryptology - Crypto '91 , vol.576 , pp. 279-287
    • Koblitz, N.1
  • 12
    • 84974692118 scopus 로고    scopus 로고
    • Analysis of the Weil Descent Attack of Gaudry, Hess and Smart
    • A. Menezes and M. Qu. Analysis of the Weil Descent Attack of Gaudry, Hess and Smart. In Proceedings RSA 2001, 2001.
    • (2001) Proceedings RSA 2001
    • Menezes, A.1    Qu, M.2
  • 15
    • 0000266095 scopus 로고
    • Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains
    • F. Morain and J. Olivos. Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains. Inform. Theor. Appl., 24: 531-543, 1990.
    • (1990) Inform. Theor. Appl. , vol.24 , pp. 531-543
    • Morain, F.1    Olivos, J.2
  • 16
    • 84919085619 scopus 로고
    • An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significants
    • S. Pohlig and M. Hellman. An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significants. IEEE Transactions on Infomation Theory, 24: 106-110, 1978.
    • (1978) IEEE Transactions on Infomation Theory , vol.24 , pp. 106-110
    • Pohlig, S.1    Hellman, M.2
  • 17
    • 84966238549 scopus 로고
    • Monte Carlo Methods for Index Computation (mod p)
    • J. Pollard. Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32: 918-924, 1978.
    • (1978) Mathematics of Computation , vol.32 , pp. 918-924
    • Pollard, J.1
  • 18
    • 0343623059 scopus 로고    scopus 로고
    • Fermat Quotients and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves
    • T. Satoh and K. Araki. Fermat Quotients and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves. Commentarii Math. Univ. St. Pauli, 47: 81-92, 1998.
    • (1998) Commentarii Math. Univ. St. Pauli , vol.47 , pp. 81-92
    • Satoh, T.1    Araki, K.2
  • 19
    • 0032352723 scopus 로고    scopus 로고
    • Evaluation of Discrete Logarithms in a Group of p-torsion Points of an Elliptic Curve in Characteristic p
    • I.A. Semaev. Evaluation of Discrete Logarithms in a Group of p-torsion Points of an Elliptic Curve in Characteristic p. Mathematics of Computation, 67: 353-356, 1998.
    • (1998) Mathematics of Computation , vol.67 , pp. 353-356
    • Semaev, I.A.1
  • 20
    • 0000211152 scopus 로고
    • A Theory of Factorization and Genera
    • D. Shanks. A Theory of Factorization and Genera. In Proc. Symp. Pure Math., 20: 415-440, 1971.
    • (1971) In Proc. Symp. Pure Math. , vol.20 , pp. 415-440
    • Shanks, D.1
  • 22
    • 0003539458 scopus 로고    scopus 로고
    • The Discrete Logarithm Problem on Elliptic Curves of Trace One
    • N. P. Smart. The Discrete Logarithm Problem on Elliptic Curves of Trace One. Journal of Cryptology, 12(3): 193-196, 1999.
    • (1999) Journal of Cryptology , vol.12 , Issue.3 , pp. 193-196
    • Smart, N.P.1
  • 23
    • 84945129506 scopus 로고    scopus 로고
    • How Secure are Elliptic Curves over Composite Extension Fields?
    • N. P. Smart. How Secure are Elliptic Curves over Composite Extension Fields? Proceedings EUROCRYPT 2001, 2045: 30-39, 2001.
    • (2001) Proceedings EUROCRYPT 2001 , vol.2045 , pp. 30-39
    • Smart, N.P.1


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