A Software Library for Elliptic Curve Cryptography
暂无分享,去创建一个
Christos D. Zaroliagis | Yannis C. Stamatiou | Elisavet Konstantinou | Y. Stamatiou | C. Zaroliagis | Elisavet Konstantinou
[1] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[2] Steven D. Galbraith. Limitations of constructive Weil descent , 2001 .
[3] Kiyomichi Araki,et al. Overview of Elliptic Curve Cryptography , 1998, Public Key Cryptography.
[4] E. Berlekamp. Factoring polynomials over large finite fields* , 1971, SYMSAC '71.
[5] Harald Baier,et al. Efficient Construction of Cryptographically Strong Elliptic Curves , 2000, INDOCRYPT.
[6] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[7] Alfred Menezes,et al. Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.
[8] Erkay Savas,et al. Generating Elliptic Curves of Prime Order , 2001, CHES.
[9] T. Valente. A distributed approach to proving large numbers prime , 1992 .
[10] Alfred Menezes,et al. The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.
[11] Ricardo Dahab,et al. Performance of Elliptic Curve Cryptosystems , 2000 .
[12] Underwood Dudley. Elementary Number Theory , 1978 .
[13] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .
[14] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[15] L. G. Lidia,et al. A library for computational number theory , 1997 .
[16] Alfred Menezes,et al. Software Implementation of the NIST Elliptic Curves Over Prime Fields , 2001, CT-RSA.