Cryptological Mathematics
DOI:
https://doi.org/10.31033/ijrasb.9.3.18Keywords:
Cryptological maths, cryptography, algorithmsAbstract
The basis of cryptography is the requirement for different parties to share information, and only those international recipients have moved to the data. It is possible to achieve this in many other ways; the most common is to physically hide the data transmitted to all except those intended to receive it. Cryptography encompasses all methods of hiding the contents of messages, even if unauthorized third parties take over the message. It is possible to conclude that practices like disguised ink or small pin puncture over specified personality could be classified as cryptography. But this isn't the case as the attacker has not discovered the data that makes up the message but simply an additional disguise. These techniques, such as disguised ink, fall under the steganography umbrella. So, cryptography tries to provide the contents of a message inaccessible to any person who might intercept it but allows those who are intended to receive it to understand the significance of the content. The sender is able to encrypt the message while the recipient decrypts it. Apart from the security achieved through encryption, there are various other aspects of information security, such as authenticity, data integrity, and non-repudiation. Together, the fields that encompass various information security techniques are known as cryptography. The techniques and methods designed to attempt to reduce the effectiveness of cryptography are called cryptanalysis. Cryptology is a field of study that encompasses both cryptanalysis and cryptography. In the field of study of modern cryptology, it's important to know the strategies used in the field and the mathematical concepts utilized to study and improve the area. A large portion of applied mathematics in the modern age and, in particular, applied math has been centered on creating algorithms through which two parties can safely exchange information. Many of these algorithms have been released in the last 30 years; certain algorithms have been deemed insecure, while others have escaped examination for a long time. The algorithms, called key agreements, are particularly important due to their effectiveness for secure, fast encryption.
Downloads
References
Wiles, K. (2021). Explorations and Applications of Modern Cryptology.
Bauer, C. (2021). Secret history: The story of cryptology. CRC Press.
Borys, T. of the Paper: Suggestion for an Integration of Cryptology into a Math Curriculum.
Ramazan, E. R. O. L., & SAYGI, E. (2021). The Effect of Using Cryptology on Understanding of Function Concept. International Journal of Contemporary Educational Research, 8(4), 80-90.
Jara-Vera, V., & Sánchez-Ávila, C. (2021). Some Notes on a Formal Algebraic Structure of Cryptology. Mathematics, 9(18), 2183.
Karaçam, C., Algül, F. N., & Tavit, D. (2021). Transmission of Time and Position Variable Cryptology in Fibonacci and Lucas Number Series with Music. Journal of Mathematical Sciences and Modelling, 4(1), 38-50.
Jacox, L. M. (2021). Using Classical Ciphers to Teach Mathematics in Secondary Education (Doctoral dissertation, Elizabeth City State University).
Bos, J., & Stam, M. (Eds.). (2021). Computational Cryptography: Algorithmic Aspects of Cryptology (Vol. 469). Cambridge University Press.
Boersma, S. (2022). A Cryptologic Dinner Party. Math Horizons, 29(4), 14-17.
Yu, Y., & Yung, M. (2021). Information Security and Cryptology. Springer International Publishing.
MATYSIAK, L. (2021). Generalized RSA cipher and Diffie-Hellman protocol. Journal of applied mathematics & informatics, 39(1_2), 93-103.
Hoborski, A., Hordyński, L., Kaszycki, L., Leja, F., Nikodym, O., Rosenblatt, A., ... & Żorawski, K. The Jubilee Congress for the 100th anniversary of the Polish Mathematical Society.
Cheon, J. H., Lauter, K., & Song, Y. (2021). Editor’s Preface for the Second Annual MathCrypt Proceedings Volume. Journal of Mathematical Cryptology, 15(1), 1-3.
Kaymak, Ö. Ö. A New Coding/Decoding Algorithm Based on k-Fibonacci Numbers. ICAMƩ’21, 147.
Galbraith, S., Panny, L., Smith, B., & Vercauteren, F. (2021). Quantum Equivalence of the DLP and CDHP for Group Actions. Mathematical Cryptology, 1(1), 40-44.
Lauter, K. E. (2021). Private AI: machine learning on encrypted data. Cryptology ePrint Archive.
Han, H., Zhu, S., Li, Q., He, Y., Wang, X., & Wang, Y. (2021). The cryptologic characteristics of circulant matrices. International Journal of Innovative Computing and Applications, 12(5-6), 248-254.
Pandey, A., Gupta, I., & Singh, D. K. (2021). Improved cryptanalysis of an ElGamal Cryptosystem Based on Matrices Over Group Rings. Journal of Mathematical Cryptology, 15(1), 266-279.
Bouftass, S. (2021). Symmetric encryption algorithms based on the mathematical structure underlying the three body problem. Cryptology ePrint Archive.
Gjergji, M., & Lamagna, E. A. (2021). A web-based toolkit for exploring cryptography. Journal of Computing Sciences in Colleges, 36(8), 53-62.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 International Journal for Research in Applied Sciences and Biotechnology
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.