Advances in Discrete Mathematics: From Combinatorics to Cryptography
Main Article Content
Abstract
Discrete mathematics forms the foundation for various fields, including computer science and cryptography, by providing essential tools for problem-solving in discrete structures. This paper explores the advancements in discrete mathematics, focusing on combinatorics and cryptography. It discusses the basic concepts of combinatorics, such as permutations, combinations, and graph theory, along with their applications in modern cryptography. The paper also examines symmetric and public key cryptography algorithms, including DES, AES, RSA, and ECC, highlighting their key features and security mechanisms. Furthermore, it explores the role of discrete structures, such as sets, relations, functions, and lattices, in cryptography, emphasizing their importance in designing secure cryptographic systems. Overall, this paper provides a comprehensive overview of the advancements in discrete mathematics and their applications in modern cryptography.
Downloads
Metrics
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
References
Barabási, A. L., & Albert, R. (2016). Emergence of scaling in random networks. Science, 286(5439),
-512.
Biggs, N. L., Lloyd, E. K., & Wilson, R. J. (2014). Graph theory: 1736–1936 (Vol. 173). Oxford
University Press.
Boneh, D., & Shoup, V. (2019). A graduate course in applied cryptography. Available online:
https://crypto.stanford.edu/~dabo/cryptobook/.
Brualdi, R. A. (2017). Introductory Combinatorics. Academic Press.
Charalambides, C. A., & Papastavridis, S. (2013). A Combinatorial Approach to Matrix Theory and Its
Applications. Chapman and Hall/CRC.
Diestel, R. (2017). Graph Theory. Springer.
Katz, J., & Lindell, Y. (2014). Introduction to Modern Cryptography (2nd ed.). CRC Press.
Lipschutz, S., & Lipson, M. (2009). Discrete Mathematics (3rd ed.). McGraw-Hill Education.
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2010). Handbook of Applied Cryptography.
CRC Press.
Micciancio, D., & Regev, O. (2009). Lattice-Based Cryptography. Available online:
https://www.cs.ucsd.edu/~daniele/papers/MR08.html.
Oded, R. (2008). Lattice theory: Foundation. Available online:
https://www.cs.technion.ac.il/~odedr/LC/LectureNotes.html.
Rosen, K. H. (2012). Discrete Mathematics and Its Applications (7th ed.). McGraw-Hill Education.
Schneier, B. (2015). Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley
& Sons.
Stallings, W. (2017). Cryptography and Network Security: Principles and Practices (7th ed.). Pearson.
Washington, L. C. (2008). Elliptic Curves: Number Theory and Cryptography (2nd ed.). CRC Press.