Cryptographic Algorithms for Enhanced Security

By: Achit Katiyar^1,2

¹South Asian University, New Delhi, India.

²International Center for AI and Cyber Security Research and Innovations, Asia University, Taiwan. Email: achitktr@gmail.com

Abstract

Cryptographic algorithms are very important for ensuring data confidentiality, integrity and veracity in today’s digital environment The need for robust and efficient cryptographic solutions has only grown as online threats have become more sophisticated. This article describes a number of cryptographic algorithms, their application scope and challenges referred to in implementing them. It also discusses emerging trends and future directions in cryptographic research.

Introduction

Cryptology is the science encrypting information to an unreadable format making it only accessible for those with correct decryption key [1]. Security of communications, data protection and privacy for digital transactions are fundamental requirements [2]. In this paper, various ideas and applications are discussed to improve the security using some major cryptographic algorithms.

Key Cryptographic Algorithms

• Symmetrical Key Algorithms:

Because symmetric key methods use the identical secret for both encryption and decryption, they are very fast and practical to large sets of data [3] .

• Advanced Encryption Standard (AES):

AES is a well-known symmetric key technique for its robustness and speed [4]. One thing that should be noted is the AES algorithm offers three bit sizes (128, 192 and 256) to generate symmetric key of desired security level for different applications [5]. The AES Encryption procedure is shown in figure 1.

• Asymmetric Key Algorithms:

More specifically, Asymmetric key algorithms use a set of two keys – first is the public one that you can share with everyone for encryption and the second private key only accessible to your own side exclusively used for decrypting [6]. It is a needed for secure key exchange and digital signatures [3].

• Rivest- Shamir-Adleman (RSA):

RSA is a basic asymmetric technique to ensure secure data transfer [7]. It involves the computational problems of finding enormous primary numbers.

• Elliptic curve cryptography (ECC):

On the other hand, ECC has a higher security level compared to its classic RSA [8]. Counterpart given fewer key sizes. Good For Resource Constrained Environments – cell phones [9].

Cryptographic algorithmic challenges

• Computational complexity:

In some cases, cryptographic techniques may need a lot of computing power, which could containe the challenges, for devices, with processing capabilities. Balancing the efficiency and security of these algorithms is a challenge [1].

• Key management:

Proper management of encryption keys is crucial to protect the security of systems. Ensuring the safety of generation, distribution and storage poses challenges [2].

• Resistant to quantum attacks:

There are challenges for encryption techniques with the development of quantum computing [10]. To confirm system security in the future, it is essential to generate algorithms strong to quantum attacks [11].

Emerging trends and future directions

• Post-Quantum Cryptography:

Post quantum cryptography aims to create algorithms that are resilient against quantum threats [11]. As quantum computing progresses, research in this field will become increasingly important [12].

• Homomorphic encryption:

Homomorphic encryption enables calculations on encrypted data without decryption, which improves privacy in cloud computing and data processing [13]. It shows potential in safe data analytics and machine learning.

• Increasing the Privacy Element in the Smart Farming System:

Due to the limitation of resources in rural farming areas where Information Technology (IT) infrastructures may not be fully developed, optimization of data encryption mechanisms for data collected through different IoT devices is important particularly when the devices are in use as well as when stored. Besides, in areas that are likely to attract local network intrusions, deep levels of secure encoding make data practically decipherable to hostile entities [14], [15].

Conclusion

Securing information in today’s world deeply relies on techniques. While established methods like AES and RSA are technologies such, as post quantum cryptography and homomorphic encryption offer promising advancements. Enhancing security will require addressing challenges related to complexity key management and quantum flexibility.

References

1. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. Boca Raton: CRC Press, 2020. doi: 10.1201/9780429466335.
2. B. Schneier and P. Sutherland, Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd ed. USA: John Wiley & Sons, Inc., 1995.
3. C. Kaufman and R. Perlman, Network Security: Private Communication in a Public World. PTR Prentice Hall, 1995.
4. J. Daemen and V. Rijmen, The Design of Rijndael. in Information Security and Cryptography. Berlin, Heidelberg: Springer, 2002. doi: 10.1007/978-3-662-04722-4.
5. “NIST Announces First Four Quantum-Resistant Cryptographic Algorithms,” NIST, Jul. 2022, Accessed: Jul. 13, 2024. [Online]. Available: https://www.nist.gov/news-events/news/2022/07/nist-announces-first-four-quantum-resistant-cryptographic-algorithms
6. W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Trans. Inf. Theory, vol. 22, no. 6, pp. 644–654, Nov. 1976, doi: 10.1109/TIT.1976.1055638.
7. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Commun ACM, vol. 21, no. 2, pp. 120–126, Feb. 1978, doi: 10.1145/359340.359342.
8. V. S. Miller, “Use of Elliptic Curves in Cryptography,” in Advances in Cryptology — CRYPTO ’85 Proceedings, H. C. Williams, Ed., Berlin, Heidelberg: Springer, 1986, pp. 417–426. doi: 10.1007/3-540-39799-X_31.
9. N. Koblitz, “Elliptic curve cryptosystems,” Math. Comput., vol. 48, no. 177, pp. 203–209, 1987, doi: 10.1090/S0025-5718-1987-0866109-5.
10. P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, Nov. 1994, pp. 124–134. doi: 10.1109/SFCS.1994.365700.
11. D. J. Bernstein, “Introduction to post-quantum cryptography,” in Post-Quantum Cryptography, D. J. Bernstein, J. Buchmann, and E. Dahmen, Eds., Berlin, Heidelberg: Springer, 2009, pp. 1–14. doi: 10.1007/978-3-540-88702-7_1.
12. A. M. Widodo et al., “Quantum-Resistant Cryptography,” in Innovations in Modern Cryptography, IGI Global, 2024, pp. 100–130. doi: 10.4018/979-8-3693-5330-1.ch005.
13. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the forty-first annual ACM symposium on Theory of computing, in STOC ’09. New York, NY, USA: Association for Computing Machinery, May 2009, pp. 169–178. doi: 10.1145/1536414.1536440.
14. M. Rahaman, C.-Y. Lin, P. Pappachan, B. B. Gupta, and C.-H. Hsu, “Privacy-Centric AI and IoT Solutions for Smart Rural Farm Monitoring and Control,” Sensors, vol. 24, no. 13, Art. no. 13, Jan. 2024, doi: 10.3390/s24134157.
15. M. Rahaman, V. Arya, S. M. Orozco, and P. Pappachan, “Secure Multi-Party Computation (SMPC) Protocols and Privacy,” in Innovations in Modern Cryptography, IGI Global, 2024, pp. 190–214. doi: 10.4018/979-8-3693-5330-1.ch008.
16. A. Gaurav, B. B. Gupta, C. -H. Hsu, D. Peraković and F. J. García Peñalvo, “Deep Learning Based Approach for Secure Web of Things (WoT),” 2021 IEEE International Conference on Communications Workshops (ICC Workshops), Montreal, QC, Canada, 2021, pp. 1-6, doi: 10.1109/ICCWorkshops50388.2021.9473677.
17. Gupta, B. B., & Nedjah, N. (Eds.). (2020). Safety, Security, and Reliability of Robotic Systems: Algorithms, Applications, and Technologies. CRC Press.

Cite As

Katiyar A. (2024) Cryptographic Algorithms for Enhanced Security, Insights2Techinfo, pp.1

795800cookie-checkCryptographic Algorithms for Enhanced Securityyes