The Equivalence Between Elliptic Curve and Quadratic Function Field Discrete Logarithms in Characteristic 2
暂无分享,去创建一个
[1] Andreas Stein,et al. Key-exchange in real quadratic congruence function fields , 1996 .
[2] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[3] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.
[4] Robert Zuccherato. New applications of elliptic curves and function fields in cryptography , 1997 .
[5] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .
[6] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[7] Robert J. Zuccherato. The Continued Fraction Algorithm and Regulator for Quadratic Function Fields of Characteristic 2 , 1997 .
[8] William W. Adams,et al. Multiples of Points on Elliptic Curves and Continued Fractions , 1980 .
[9] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[10] A. Stein. Equivalences between elliptic curves and real quadratic congruence function fields , 1997 .
[11] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .
[12] Scott A. Vanstone,et al. Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2 , 1998, Des. Codes Cryptogr..
[13] Andreas Stein,et al. Computing discrete logarithms in real quadratic congruence function fields of large genus , 1999, Math. Comput..
[14] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.