TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Exploration and comparison of cryptographic algorithms for security

, , , , , *

* Corresponding author · click or hover a name for details

pp. 2527–2537Vol. 28Issue 6September 2025DOI: 10.47974/JDMSC-2337 Crossmark XML
Received:
05 Mar 2024
Published Online:
09 Jul 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2337
Pages:
2527–2537

Abstract

Cryptography is one of the cornerstones of secured communication in the digital age, enabling confidentiality, integrity, and authentication in various applications. This paper provides an exploration and comprehensive review of cryptography algorithms, discussing their underlying principles, strengths, weaknesses, and areas of application. The review covers classical algorithms like RSA, DES, and AES, as well as modern advancements, including elliptic curve cryptography and post-quantum cryptography. Additionally, it addresses the challenges faced by cryptography in the era of evolving technological threats.

Keywords

Subject Classifications

Primary 68R01Secondary 97N70

References

[1] P. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems,” in Advances in Cryptology—CRYPTO’96, Berlin, Heidelberg: Springer, 1996, pp. 104–113.
[2] 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, 1978.
[3] U.S. National Bureau of Standards, “Data encryption standard,” Federal Inf. Process. Standards Publ., vol. 112.3, 1999.
[4] B. Sun, Z. Xiang, Z. Dai, G. Liu, X. Shen, L. Qu, and S. Fu, “Feistel-like structures revisited: classification and cryptanalysis,” in Annual Int. Cryptology Conf., Cham: Springer Nature Switzerland, 2024.
[5] P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proc. 35th Annu. Symp. Foundations of Computer Science (FOCS), 1994, pp. 124–134.
[6] C. Paar, J. Pelzl, and T. Güneysu, Introduction to Cryptography and Data Security. Springer Science and Business Media LLC, 2024, pp. 1–35.
[7] J. Daemen and V. Rijmen, The Design of Rijndael: AES—The Advanced Encryption Standard, Berlin, Heidelberg: Springer, 2002, pp. 1–8, doi: 10.1007/978-3-662-04722-4.
[8] V. S. Miller, “Use of elliptic curves in cryptography,” in Advances in Cryptology—CRYPTO ‘85, Berlin, Heidelberg: Springer, 1985, pp. 417–426.
[9] N. Koblitz, “Elliptic curve cryptosystems,” Math. Comput., vol. 48, no. 177, pp. 203–209, 1987.
[10] B. Schneier, “Twofish: A 128-bit block cipher,” in Proc. Cryptographic Hardware and Embedded Systems (CHES), 1998.
[11] A. Kumar, P. Dadheech, V. Singh, L. Raja, and R. C. Poonia, “An enhanced quantum key distribution protocol for security authentication,” J. Discrete Math. Sci. Cryptogr., vol. 22, no. 4, pp. 499–507, 2019.
[12] A. L. Imoize, W. Montlouis, M. S. Obaidat, S. I. Popoola, and M. Hammoudeh, Computational Modeling and Simulation of Advanced Wireless Communication Systems, Boca Raton, FL: CRC Press, 2024, pp. 1–7.
[13] N. V. Y. Lankadasu, D. B. Pesarlanka, A. Sharma, and S. Sharma, “Security aspects of blockchain technology,” in IGI Global, 2024, pp. 259–277.
[14] C. Peikert, “A decade of lattice cryptography,” Found. Trends Theor. Comput. Sci., vol. 10, no. 4, pp. 283–424, 2016.
[15] O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” J. ACM, vol. 34, pp. 1–40, 2009.
[16] S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” 2008. [Online]. Available: https://bitcoin.org/bitcoin.pdf
[17] A. Kumar, P. Dadheech, V. Singh, R. C. Poonia, and L. Raja, “An improved quantum key distribution protocol for verification,” J. Discrete Math. Sci. Cryptogr., vol. 22, no. 4, pp. 491–498, 2019.
[18] J. Katz and Y. Lindell, Introduction to Modern Cryptography, 3rd ed., Boca Raton, FL: Chapman and Hall/CRC, 2019, pp. 1–22.
[19] J. Daemen and V. Rijmen, “AES proposal: Rijndael,” A report for NIST, Computer Security Resource Center (CSRC), 1999.
[20] M. S. Kamarposhti, A. Ghorbani, and M. Yadollahi, “A comprehensive survey on image encryption: Taxonomy, challenges, and future directions,” Chaos, Solitons & Fractals, 2024.
[21] B. Schneier, “The IDEA encryption algorithm—The International Data Encryption Algorithm (IDEA),” vol. 18, pp. 50–57, 1993.
[22] P. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems,” in Proc. CRYPTO’96, Santa Barbara, Aug. 18–22, 1996, pp. 104–113.
[23] M. Gruber, P. Karl, and G. Sigl, “Algebraic fault analysis of Subterranean 2.0,” in Workshop on Fault Detection and Tolerance in Cryptography (FDTC), 2021.

Views: 297Downloads: 138Citations: 0