Asaduzzaman, A., Gummadi, D. and Waichal, P., 2015, April. A promising parallel algorithm to manage the RSA decryption complexity. In SoutheastCon 2015 (pp. 1-5). IEEE. DOI: 10.1109/SECON.2015.7132926
Beitabdollah, M., Esmaeildoust M. and Kaabi, A., 2016. Performance Evaluation of Symmetric Key Cryptography Algorithms. Journal of Marine Sceince and technology, 19(1), pp. 404-455. https://doi.org/10.22113/jmst.2016.40455.
Collins, T., Hopkins, D., Langford, S. and Sabin, M., Tandem Computers Inc, 1998. Public key cryptographic apparatus and method. U.S. Patent 5,848,159.
Fiat, A. 1997. Batch RSA. Journal of Cryptology, 10(2), pp.75–88. https://doi.org/10.1007/s0 01459900021.
Jones, G.A. and Jones, J.M., 1998. Elementary number theory. Springer Science & Business Media.
Kayode, S.Y. and Alagbe, G.K., 2018. RSA Cryptosystem Encryption Based on Three Moduli Set with Common Factor {2n+ 2, 2n+ 1, 2n}. Computing and Information Systems, 22(3), pp.27-34.
Lin, S.H., Sheu, M.H. and Wang, C.H., 2008. Efficient VLSI design of residue-to-binary converter for the moduli set (2 n, 2 n+ 1-1, 2 n-1). IEICE transactions on information and systems, 91(7), pp.2058-2060. DOI: 10.1093/ietisy/e91-d.7.2058
Mohan, P.A. and Premkumar, A.B., 2007. RNS-to-Binary Converters for Two Four-Moduli Sets $\{2^{n}-1, 2^{n}, 2^{n}+ 1, 2^{{n}+ 1}-1\} $ and $\{2^{n}-1, 2^{n}, 2^{n}+ 1, 2^{{n}+ 1}+ 1\} $. IEEE Transactions on Circuits and Systems I: Regular Papers, 54(6), pp.1245-1254. DOI: 10.1109/TCSI.2007.895515
Molahosseini, A.S., Navi, K., Hashemipour, O. and Jalali, A., 2008. An efficient architecture for designing reverse converters based on a general three-moduli set. journal of Systems Architecture, 54(10), pp.929-934. https://doi.org/10.1016/j.sysarc.2008.03.006
Omondi, A.R. and Premkumar, A.B., 2007. Residue number systems: theory and implementation (Vol. 2). World Scientific. https://doi.org/10.1142/p523
Paixao Filho, C.A.M., 2003. DLG: An efficient variant of the RSA cryptosystem. Eprint Archive.
Patronik, P. and Piestrak, S.J., 2017. Design of Reverse Converters for a New Flexible RNS Five-Moduli Set {2 k, 2 n-1, 2 n+ 1, 2 n+ 1-1, 2 n-1-1}(n Even). Circuits, Systems, and Signal Processing, 36(11), pp.4593-4614. https://doi.org/10.1007/s00034-017-0530-9.
Quisquater, J.J. and Couvreur, C., 1982. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics letters, 18(21), pp.905-907. https://doi.org/10.1049/el:19820617
Rivest, R.L., Shamir, A. and Adleman, L., 1978. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21, pp. 120-126. https://doi.org/10.1145/359340.359342.
Sousa, L., Antão, S. and Chaves, R., 2012. On the Design of RNS Reverse Converters for the Four-Moduli Set ${\bf\{2^{\mmb n}+ 1, 2^{\mmb n}-1, 2^{\mmb n}, 2^{{\mmb n}+ 1}+ 1\}} $. IEEE transactions on very large scale integration (VLSI) systems, 21(10), pp.1945-1949. 10.1109/TVLSI.2012.2219564
Takagi, T., 1998, August. Fast RSA-type cryptosystem modulo pkq. In Annual International Cryptology Conference (pp. 318-326). Berlin, Heidelberg: Springer Berlin Heidelberg.
Wang, Y., 2000. Residue-to-binary converters based on new Chinese remainder theorems. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 47(3), pp.197-205. http://dx.doi.org/10.1109/82.8267 45.
