Kaya Y., Gürkaş Aydın G. Z., Akgul A.
PHYSICA SCRIPTA, cilt.100, sa.4, ss.45203, 2025 (SCI-Expanded, Scopus)
-
Yayın Türü:
Makale / Tam Makale
-
Cilt numarası:
100
Sayı:
4
-
Basım Tarihi:
2025
-
Doi Numarası:
10.1088/1402-4896/adb812
-
Dergi Adı:
PHYSICA SCRIPTA
-
Derginin Tarandığı İndeksler:
Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Chemical Abstracts Core, Compendex, INSPEC, zbMATH
-
Sayfa Sayıları:
ss.45203
-
İstanbul Üniversitesi-Cerrahpaşa Adresli:
Evet
Özet
Abstract
This study introduces a novel lightweight encryption scheme for platforms with limited resources utilizing chaotic systems. We employ a dual logistic map, utilizing the first map to determine cyclic rotation step counts for rows and columns in the confusion phase, and the second map for the XoR operation in the diffusion phase. Input parameters of the first logistic map are derived from only the secret key while the input parameters of the second logistic map are derived from the secret key and hash value of plaintext together. Since we use the hash value of the plaintext to determine the input parameter of the second logistic map, our schema is highly resistant to differential attacks. On average, it produces over %99.57 NPCR value and about %33.45 UACI value in case of one-pixel change in the plaintext. It also produces an information entropy value of over 7.9971 on average. Since we use a double logistic map, our scheme is resistant to brute force attacks via about 196 bits of key length. Firstly, we calculate the hash value of the plaintext which will be used to determine the input parameter of the second logistic map. Then we employ cyclic rotation operation for all rows and all columns utilizing the key stream generated by the first logistic map at the permutation stage. Subsequently, we performed the XoR operation to the output, utilizing the key stream of the second logistic map which is initialized with the hash value and secret key. Since we need the hash value of the plaintext in the decryption process, we need to save it in the ciphertext. So, we add a new row at the bottom of the ciphertext to make room for the hash value. We save and distribute it into the matrix by swapping operations and obtaining final ciphertext. To decrypt the ciphertext, we follow these steps in reverse order. First, we extract the hash value of the original plaintext from the ciphertext. Then, we apply XOR and cyclic rotation operations. Our test and analysis results demonstrate that our schema is pretty fast, reliable, robust, feasible and successful. It is a good lightweight encryption scheme alternative for resource-limited platforms.