Improving Rebalanced RSA Against Chosen Ciphertext Attacks
DOI:
https://doi.org/10.26438/ijcse/v6i9.944947Keywords:
Ciphertext, Decryption, Encryption, Rebalanced RSAAbstract
RSA cryptosystem is the most widely used public key cryptosystem. There have been many variants to the original RSA proposed in the literature and Rebalanced RSA is one of such modified RSA cryptosystems. This paper provides new designs of Rebalanced RSA which are semantically secure against chosen ciphertext attack as well as adaptive chosen ciphertext attack. The proposed schemes are proved to be more efficient than other schemes like DRSA, Rebalanced RSA and standard RSA.
References
[1] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Communications of the ACM , Vol.21, No. 2, pp.120-126, 1978.
[2] Ch. Padmaja, “Number theory: Backbone of RSA cryptography”, Global Journal of Pure and Applied Mathematics, Vol.11, No.5, pp.3495-3500, 2015.
[3] Ch. Padmaja, B. Srinivas, and V.S. Bhagavan, “A Systematic Mapping Study of the Published Research on Cryptanalytic Attacks on RSA”, International Journal of Pure and Applied Mathematics, Vol.119, No. 11, pp.283-291, 2018.
[4] S. Goldwasser and S. Micali, “ Probabilistic Encryption”, Journal of Computer and System Sciences, Vol.28, pp.270–299, 1984.
[5] S. Pradhan, “A Study of Public Key Cryptosystems Based on Factorization”, Ph.D. thesis, Pt. Ravishankar Shukla University, Raipur, India, 2013.
[6] Ch. Padmaja, B. Srinivas, and V.S. Bhagavan, “On the Usage of Aryabhatta Remainder Theorem for Improved Performance of Rprime RSA”, Journal of Theoretical and Applied Information Technology, Vol.96, No.9,pp.2505-2518, 2018.
[7] M.J.Wiener, “ Cryptanalysis of short RSA secret exponents”, IEEE Transactions on Information Theory, Vol.36, No.3, pp.553-558, 1990.
[8] Ch. Padmaja, V.S. Bhagavan, and B. Srinivas, “Enhancing the performance of Rebalanced RSA”, Journal of Computer and Mathematical Sciences, (In Press), 2018.
[9] H. Ghodosi, “ An efficient public key cryptosystem secure against chosen ciphertext attack”, Information system security, Lecture Notes in Computer Science, Vol. 4332, pp.303-314, 2007.
[10] D. Pointcheval, “ New Public Key Cryptosystems Based on the Dependent–RSA Problems”, In Proceedings of Eurocrypt`99, Lecture Notes in Computer Science, Vol.1592, pp.239-254, 1999.
[11] M. Bellare and P. Rogaway, “Optimal Asymmetric Encryption-How to Encrypt with RSA”, Advances in Cryptology - Proceedings of Eurocrypt’94, Lecture Notes in Computer Science, Vol. 950, pp.92–111, 1994.
[12] S.Dubey,R.Jhaggar, R.Verma, and D. Gaur, “Encryption and Decryption of Data by Genetic Algorithm”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, No.3, pp.42-46.
[13] V. Kapoor, “Data Encryption and Decryption Using Modified RSA Cryptography Based on Multiple Public Keys and ‘n’prime Number”, International Journal of Scientific Research in Network Security and Communication, Vol.1, No.2, pp.35-38.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
