References
- A. Fait. Batch RSA, Advances in cryptology. In Proceedings of crypto’89, vol.435 of LNCS, pp.175-185, Springer-Verlag 1989.
- A. Menezes, P. Van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. In CRC Press, 1997.
- D. Boneh and H. Shacham. Fast variants of RSA. In RSA Laboratories, 2002.
- D.E.G. Malm. On Monte-Carlo primality tests. In Notices Amer. Math. Soc., pages A-529, 1977.
- D.H. Lehmer. On Euler’s totient function. In Bull. Amer. Math. Soc., 38 (1932), pp. 745–751. doi: https://doi.org/10.1090/S0002-9904-1932-05521-5
- D.J. Newmann. Simple analytic proof of the prime number theorem. In American Math.Monthly, PP: 693-696, 1980. doi: https://doi.org/10.1080/00029890.1980.11995126
- H. Cohen. A Course in Computational Algebraic Number Theory, vol 138 of Graduate Texts in Mathematics, Springer-Verlag, 1996.
- H. Riele, K. Aardal, J. Gilchrist. Factorization of a 512-Bit RSA Modulus. In Proceedings of Eurocrypt’2000,vol.1807 of Lecture Notes in Computer Science (LNCS), pp. 1-11, Springer-Verlag, 2000.
- Kunal Gagneja and John Singh. Survey and analysis of security issues on RSA algorithm for digital video data. Journal of Discrete Mathematical Sciences and Cryptography, vol 19(1), pp. 39-55, 2016. doi: https://doi.org/10.1080/09720529.2015.1085730
- L. Sreenivasulu Reddy, K. Ramakrishna Prasad, N.Ch. S.N. Iyengar, and V. Ramachandran. Solovay-Strassen test in a RSA Pubic key Cryptosystem. In International Journal of Computer Theory and Engineering, Vol. 2, No. 1, February 2010, 1793-8201.