1. [1] T. Elgamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. Inf. Theory, vol.31, no.4, pp.469-472, July 1985.
2. [2] C.K. Koc, “High-speed RSA implementations,” RSA Laboratories, Technique Notes TR201, Available from URL: http://www.rsasecurity.com/rsalabs/, pp.9-32, Nov. 1994.
3. [3] D.E. Knuth, The Art of Computer Programming, vol.2, Seminumerical algorithms, pp.265-318 and pp.461-485 Addison-Wesley, 1st edition, 1969, 2nd edition 1982, 3rd edition 1998.
4. [4] A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, Discrete Mathematics and Its Applications, pp.591-629, CRC Press, 1996.
5. [5] P.L. Montgomery, “Modular multiplication without trial division,” Math. Comput., vol.44, no.170, pp.519-519, April 1985.