The Montgomery Modular Inverse-Revisited
暂无分享,去创建一个
[1] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[2] Donald E. Knuth. The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .
[3] Burton S. Kaliski,et al. The Montgomery Inverse and Its Applications , 1995, IEEE Trans. Computers.
[4] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[5] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.
[6] Ömer Egecioglu,et al. Exponentiation Using Canonical Recoding , 1994, Theor. Comput. Sci..
[7] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[8] Dirk Fox,et al. Digital Signature Standard (DSS) , 2001, Datenschutz und Datensicherheit.
[9] Hilarie K. Orman,et al. Fast Key Exchange with Elliptic Curve Systems , 1995, CRYPTO.
[10] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[11] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[12] O E Gecio Glu,et al. Exponentiation Using Canonical Recoding , 1994 .
[13] J. Quisquater,et al. Fast decipherment algorithm for RSA public-key cryptosystem , 1982 .
[14] Wolfgang Bauer. Implementing elliptic curve cryptography , 2002, Communications and Multimedia Security.