Syeda Wajiha Zahra¹, Muhammad Nadeem², Ali Arshad^3,*, Saman Riaz³, Muhammad Abu Bakr⁴, Ashit Kumar Dutta⁵, Zaid Alzaid⁶, Badr Almutairi⁷, Sultan Almotairi⁸

CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 589-616, 2024, DOI:10.32604/cmc.2023.042386

Abstract Various organizations store data online rather than on physical servers. As the number of user’s data stored in cloud servers increases, the attack rate to access data from cloud servers also increases. Different researchers worked on different algorithms to protect cloud data from replay attacks. None of the papers used a technique that simultaneously detects a full-message and partial-message replay attack. This study presents the development of a TKN (Text, Key and Name) cryptographic algorithm aimed at protecting data from replay attacks. The program employs distinct ways to encrypt plain text [P], a user-defined Key [K], and a Secret Code… More >

Mustafa Asci, Suleyman Aydinyuz^*

CMES-Computer Modeling in Engineering & Sciences, Vol.131, No.1, pp. 277-293, 2022, DOI:10.32604/cmes.2022.017898

Abstract The Advanced Encryption Standard (AES) is the most widely used symmetric cipher today. AES has an important place in cryptology. Finite field, also known as Galois Fields, are cornerstones for understanding any cryptography. This encryption method on AES is a method that uses polynomials on Galois fields. In this paper, we generalize the AES-like cryptology on 2 × 2 matrices. We redefine the elements of k-order Fibonacci polynomials sequences using a certain irreducible polynomial in our cryptology algorithm. So, this cryptology algorithm is called AES-like cryptology on the k-order Fibonacci polynomial matrix. More >