A New Modification of RSA Cryptosystem Based on The Number of The Private Keys

Hayder Raheem Hashim


The need of  the privacy for each person has encouraged cryptologists to create and modified  cryptosystems. However, the RSA cryptosystem is a secure public key cryptosystem, this paper focuses on modifying RSA cryptosystem by increasing the number of private keys. This modification can be applied over plaintext messages, plain matrices, however in this paper, I focuse on applying it particulary on matrices which are the corresponding matrices of images. A public key and private key are contained in this secure cryptosystem, and the security of its private key depends on the integer factorization problem. But, this only private key might be found by inspection. Therefore, this new modification gives the RSA cryptosystem a higher security, because it suggests a "k" number of distinct private keys. Therefore, this new modification makes the RSA cryptosystem more secure and a confidential public key cryptosystem.


Cryptography; public key cryptosystem; RSA cryptosystem.

Full Text:



Ayele, A. A., & Sreenivasarao, V.“ A Modified RSA Encryption Technique Based on Multiple public keys”. International Journal of Innovative Research in Computer and Communication Engineering, vol.1, 2013.

Hussain, A. K. “A Modified RSA Algorithm for Security Enhancement and Redundant Messages Elimination Using K-Nearest Neighbor Algorithm”. IJISET-International Journal of Innovative Science, Engineering & Technology, vol. 2, 2015.

Abudin, J., Keot, S. K., Malakar, G., Borah, N. M., & Rahman, M. “Modified RSA PublicKey Cryptosystem Using Two Key Pairs”. International Journal of Computer Science and Information Technologies,vol. 5, pp. 3548-3550, 2014.

Hassan, A. K. S., Shalash, A. F., & Saudy, N. F. “MODIFICATIONS ON RSA CRYPTOSYSTEM USING GENETIC OPTIMIZATION”. International Journal of Research and Reviews in Applied Sciences, vol. 19, 2014.

Dhakar, R. S., Gupta, A. K., & Sharma, P.“Modified RSA encryption algorithm (MREA) ”. Second International Conference on Advanced Computing & Communication Technologies, IEEE, 2012.

Patidar, R., & Bhartiya, R. “ Modified RSA cryptosystem based on offline storage and prime number”. In Computational Intelligence and Computing Research (ICCIC), 2013 IEEE International Conference, IEEE, ‏2013.

Sharma, S., Sharma, P., & Dhakar, R. S. “RSA algorithm using modified subset sum cryptosystem. In Computer and Communication Technology (ICCCT) ”, 2011 2nd International Conference , IEEE, 2011. ‏

Sharma, S., Yadav, J. S., & Sharma, P. “ Modified RSA public key cryptosystem using short range natural number algorithm”. International Journal, vol. 2, 2012. ‏

Ivy, B. P. U., Mandiwa, P., & Kumar, M. “A modified RSA cryptosystem based on ‘n’ prime numbers”. International Journal Of Engineering And Computer Science, vol. 1, pp.63-66, 2012. mathematical cryptography. New York: springer, 2008.

Damgård, I., & Koprowski, M.“Practical threshold RSA signatures without a trusted dealer”. International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2001.‏

Rosen, K.H. Elementary Number Theory and Its Applications,5th Edn. United State of America, Boston: Addison Wesley, 2005.


  • There are currently no refbacks.

Comments on this article

View all comments




About ASRJETS | Privacy PolicyTerms & Conditions | Contact Us | DisclaimerFAQs 

ASRJETS is published by (GSSRR).