Enhancing digital security through randomized cryptology: a novel algorithm utilizing prime numbers, pi, linear encryption, and matrices

Year 2024, Volume: 5 Issue: 1, 23 - 27

Neslihan Gül

Abstract

Recently, the widespread use of computer technology and the development of the internet have facilitated access to information. However, this has also increased the importance of information security. Public and private sector organizations need robust databases to protect their digital assets. For this reason, many security-oriented products and projects are being developed. Especially with the rapid progress of the internet age and the increasing importance of digital security, the field of cryptology has attracted great interest. Cryptology is the science of ciphers. The infrastructure of cryptology is based on mathematics. In order to ensure the security of information in the digital environment, a strong database is needed. This is achieved with strong encryption algorithms. Algorithms that incorporate the principle of randomness and allow repeating letters to take different values are stronger against external attacks. For these reasons, the aim of this study is to create a cryptology algorithm that is resistant to password cracking techniques, adopts the principle of randomness, contains mathematical formulas and has a decryption. In this study, prime numbers, pi number, linear encryption technique and matrices are used. In the encryption algorithm, it is aimed to adopt the principle of randomness with prime numbers and pi number. By using linear encryption technique and matrices, new sequence numbers of each letter were obtained, and it was aimed to strengthen against the frequency analysis method, which is one of the password cracking techniques, by ensuring that the repeating letters take different number values.

Keywords

Cryptology, Digital security, Encryption, Information security

References

• Bahadır, E., & Özdemir, A. Ş. (2012). Examining the applicability of substitution cipher activity and students' opinions about the activity. KALEM International Journal of Education and Human Sciences, 2(2), 51-90.
• Buluş, H. N. (2006). Examination of basic cryptographic algorithms and crypto analysis. Master's Thesis. Trakya University, Edirne, Türkiye.
• Chua, B. L. (2008). Harry potter and the coding of secrets. Mathematics Teaching in the Middle School, 14(2), 114-121.
• Coşkun, A., & Ülker, Ü. (2013). Development of a cryptography algorithm for national information security and reliability determination against letter frequency analysis. International Journal of Informatics Technologies, 6(2), 31-39.
• Güler, E. (2007). The effect of encryption activities on mathematics achievement in the teaching of modular arithmetic subject. Master's Thesis. Marmara University, Istanbul Türkiye.
• Jones, A. (2012). Information warfare-what has been happening? ComputerFraud& Security, 4-7.
• Katrancı, Y., & Özdemir, A. Ş. (2013). Strengthening the subject of modular arithmetic with the help of RSA encryption. KALEM International Journal of Education and Human Sciences, 3(1), 149-186.
• Mollin, R. A. (2007). An introduction to cryptography. CRC Press.
• Özdemir, A. Ş., & Erdoğan, F. (2011). Teaching factorial and permutation with encryption activities. West Anatolian Journal of Educational Sciences, 1(3), 19-43.
• Sahal, M., & Özdemir, A. Ş. (2018). Examination of the activities about enciphering done with fifth grade students and their views about the activities. International Online Journal of Educational Sciences, 10(3), 1-21.
• Welsh, D. (1988). Codes and cryptography. Oxford University Press. Yılmaz, R. (2010). Some statistical tests in cryptologic applications. Master's Thesis. Selçuk University, Konya, Türkiye