The week's pick
Random Articles
Reseach Article
An Enhanced Asymmetric Cryptosystem using Multiple Key System
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 176 - Number 15 |
| Year of Publication: 2020 |
| Authors: Steve Okyere-Gyamfi, J. B. Hayfron Acquah, Vivian Akoto-Adjepong |
10.5120/ijca2020920017
|
Steve Okyere-Gyamfi, J. B. Hayfron Acquah, Vivian Akoto-Adjepong . An Enhanced Asymmetric Cryptosystem using Multiple Key System. International Journal of Computer Applications. 176, 15 ( Apr 2020), 18-26. DOI=10.5120/ijca2020920017
Abstract
An increase in network technology development has its own downside; thus as more connections are established with various global computer networks daily, the more exposed the connected systems are to unauthorized access, thus making security of data very important to address. Internet based transaction applications such as internet banking, online shopping, etc., involves sharing of very sensitive information between two or more parties that should be confidential. This requires very secure end-to-end connections that will ensure the data integrity, confidentiality, authenticity, etc. Cryptography is one of the most reliable and best, if not the best way to keep sensitive data from unauthorized users. This implies a good cryptosystem that maximizes security of the information been transferred and minimizes a substantial amount of delay time is needed. This is dependent on the particular cryptosystem one chooses to secure information. Also of the two known types of cryptosystems, the best in security is asymmetric cryptosystems, which uses two different keys; one for encryption and the other for decryption, whiles symmetric cryptosystems use the same key for both encryption and decryption. The essential features of asymmetric cryptosystems that determines their efficiency and security are; encryption computation time, decryption computation time, performance, encryption throughput, decryption throughput, throughput, randomness, key length and Operation per Instruction (O/I). This research seeks to examine these properties of some asymmetric cryptosystems and subsequently develop a proposed cryptosystem that is more secure and efficient. The results of this research clearly demonstrate that, the proposed cryptosystem has better results for all the properties stated above.
References
- Singh, L., and Bharti, R. K., (2013). “Comparative Perfomance Analysis of Cyptographic Algorithms,” International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE), vol. 3(issue 11): pp. 11.
- Gambhir, A. (2014), “RSA Algorithm or DES Algorithm,” Journal of Engineering Computers & Applied Sciences, vol 3(issue 4): pp. 27-28.
- Kakkar, A., Bansal P. K., and Singh, M. L. (2012). “Comparison of Various Encryption Algorithms and Techniques for Secured Data Communication in Multinode Network,” International Journal of Engineering and Technology (IJET), vol. 2 (issue 1): pp. 87-89.
- Yogita, (2016). “Analysis of RSA Encryption to Purpose Two – Step Improvement,” Imperial Journal of Interdisciplinary Research (IJIR), vol. 2(issue 6): pp. 641-642.
- Kim, H. W., and Lee, S., (2004). “Design and Implementation of a Private and Public Key Crypto Processor and Its Application to a Security System,” IEEE Transactions on Consumer Electronics, vol. 50 (issue 1): pp. 214-224.
- Sharma, S., Yadav J. S., and Sharma, P., (2012). “Modified RSA Public Key Cryptosystem Using Short Range Natural Number Algorithm,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 2 (issue 8): pp. 134-138.
- Orman, H., and Hoffman, P., (2004). “Determining Strengths For Public Keys Used For Exchanging Symmetric Keys,” ISOC RFC 3766 (BCP 86): pp. 3-6.
- Williams, H. C., (1980). A Modification of the RSA Public-Key Encryption Procedure. IEEE Transactions on Information Theory, vol. 26(issue 6): pp. 726-729.
- Sun, H. M., Wu, M. E., Ting,W. C., and Hinek, M. J., (2007). Dual RSA and Its Security Analysis. IEEE Transactions on Information Theory, vol. 53(issue 8): pp. 2922-2933.
- Lenstra, A. K., Hughes, J. P., Augier, M., Bos, J. W., Kleinjung, T., and Wachter, C., (2012). “Ron was wrong, Whit is right,” EPFL IC LACAL: pp. 1-2.
- Moore, S. K. (2012). UPDATE: RSA Responds to Flaw Finding. http://www.spectrum.ieee.org/techtalk.computing/it/rsa-flaw-found
- Kaminsky, D. (2012). Survey is good, Thesis is strange. http://www.dankaminsky.com
- Arya, P. K., Aswal, M. S., and Kumar, V., (2015). “Comparative Study of Asymmetric Key Cryptographic Algorithms,” International Journal of Computer Science and Communication Networks, vol. 5 (issue 1): pp. 17-21.
- Singh, R., and Kumar, S., (2012). “Elgamal‘s Algorithm in Cryptography,” International Journal of Scientific & Engineering Research, vol. 3(issue 12): pp. 1-4.
- Seurin, Y. and Treger, J. (2013). A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. Lecture Notes in Computer Science, vol. 7779: pp. 1-2
- Hankerson, D., Menezes, A., and Vanstone, S., (2004). Guide to Elliptic Curve Cryptography. Verlag Berlin HeidelbergPublications: Springer, pp: 1-15.
- Koblitz, N., (1987). “Elliptic Curve Cryptosystems,” Journal of Mathematics of Computation, published by American Mathematical Society, vol. 48 (issue 177): pp. 203-209.
- Lenstra A. K., and Lenstra, Jr. H. W., (1993). The Development of the Number Field Sieve. Lecture Notes in Mathematics. Verlag Berlin Heidelberg Publications: Springer, vol. 1554: pp. 11-47.
- Parmar, K., and Jinwala, D. C., (2015). “Symmetric-Key Based Homomorphic Primitives for End-to-End Secure Data Aggregation in Wireless Sensor Networks,” Journal of Information Security, vol.6 (issue 1): pp. 39-41.
Index Terms
Keywords