Developing Random Prime Number Substitution Cipher for Cryptography
DOI:
https://doi.org/10.32628/CSEIT1820116Keywords:
Decryption, Encryption, Prime Number Randomness, Substitution CipherAbstract
This paper introduces the Random Prime Number Substitution Cipher (RPN-SC), a novel cryptographic technique that employs randomized prime number mappings to encrypt and decrypt textual data. By leveraging the mathematical properties of prime numbers and incorporating randomness, the RPN-SC enhances security against traditional cryptanalytic attacks. The cipher's implementation is demonstrated through a web-based application, providing an interactive platform for users to explore encryption and decryption processes.
References
- Jain, A., Dedhia, R., & Patil, A. (2015). Enhancing the security of Caesar cipher substitution method using a randomized approach for more secure communication. arXiv preprint arXiv:1512.05483.
- Naidu, K.P., Rao, V.L., & Kumar, A.U. (2014). Character-Based Symmetric Key Algorithm using Randomized Prime Numbers. International Journal of Engineering Research & Technology (IJERT), 3(2).
- Dey, S., Abraham, A., & Sanyal, S. (2010). An LSB data hiding technique using prime numbers. arXiv preprint arXiv:1003.5509.
- Diffie, W., & Hellman, M. (1976). New directions in cryptography. IEEE Transactions on Information Theory, 22(6), 644-654.
- Rivest, R.L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
- Koblitz, N., & Miller, V. (1985). Elliptic curve cryptosystems. Proceedings of the International Conference on Advances in Cryptology, 262-273.
- Cocks, C. (1997). An identity-based encryption scheme based on quadratic residues. Proceedings of the IMA International Conference on Cryptography and Coding, 360-363.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

This work is licensed under a Creative Commons Attribution 4.0 International License.