Fast exponentiation method obtained by folding the exponent in half
暂无分享,去创建一个
[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[2] Che Wun Chiou. Parallel implementation of the rsa public-key cryptosystem , 1993 .
[3] Tzong-Chen Wu,et al. Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih , 1995 .
[4] J. Wrench. Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .
[5] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[6] Sung-Ming Yen,et al. Common-multiplicand multiplication and its applications to public key cryptography , 1993 .
[7] Chin-Chen Chang,et al. Hybrid method for modular exponentiation with precomputation , 1996 .