Efficient Modular Squaring Algorithms for Hardware Implementation in GF(p)
暂无分享,去创建一个
[1] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[2] Anatolij A. Karatsuba,et al. Multiplication of Multidigit Numbers on Automata , 1963 .
[3] George Joseph,et al. Design and implementation of high-speed algorithms for public-key cryptosystems , 2005 .
[4] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[5] Dan Boneh,et al. Digital Signature Standard , 2005, Encyclopedia of Cryptography and Security.
[6] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[7] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[8] Paul G. Comba,et al. Exponentiation Cryptosystems on the IBM PC , 1990, IBM Syst. J..
[9] Hyunsoo Yoon,et al. New Modular Multiplication Algorithms for Fast Modular Exponentiation , 1996, EUROCRYPT.
[10] Paul Barrett,et al. Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor , 1986, CRYPTO.
[11] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[12] P. L. Montgomery. Modular multiplication without trial division , 1985 .