An Implementation of Elliptic Curve Cryptosystems Over F2155
暂无分享,去创建一个
[1] Shuhong Gao,et al. Optimal normal bases , 1992, Des. Codes Cryptogr..
[2] René Schoof,et al. Nonsingular plane cubic curves over finite fields , 1987, J. Comb. Theory A.
[3] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .
[4] Alfred Menezes,et al. Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.
[5] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[6] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[7] R. Zuccherato,et al. Counting Points on Elliptic Curves Over F2m , 1993 .
[8] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[9] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .
[10] J. Pollard,et al. Monte Carlo methods for index computation () , 1978 .
[11] Neal Koblitz,et al. Constructing Elliptic Curve Cryptosystems in Characteristic 2 , 1990, CRYPTO.
[12] Ronald C. Mullin,et al. Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..