A cryptography using lifting scheme integer wavelet transform over min-max-plus algebra

Yunus, Mahmud, Firmansyah, Mohamad Ilham Dwi, and Subiono, Kistosil Fahim. "A cryptography using lifting scheme integer wavelet transform over min-max-plus algebra." Kybernetika 60.5 (2024): 576-602. <http://eudml.org/doc/299803>.

@article{Yunus2024,
abstract = {We propose a cryptographic algorithm utilizing integer wavelet transform via a lifting scheme. In this research, we construct some predict and update operators within the lifting scheme of wavelet transforms employing operations in min-max-plus algebra, termed as lifting scheme integer wavelet transform over min-max-plus algebra (MMPLS-IWavelet). The analysis and synthesis process on MMPLS-IWavelet is implemented for both encryption and decryption processes. The encryption key comprises a sequence of positive integers, where the first element specifies MMPLS-IWavelet type and subsequent elements indicate the levels of each executed transformation. The decryption key involves three components: the original encryption key, a binary encoding of the analyzed signal, and a sequence of non-negative integer representing the length of coefficient signals from the approximation and detail signals. We present a rigorous analysis confirming the correctness of the proposed cryptographic scheme, and evaluate its performance based on various metrics such as correlation value between plaintext and ciphertext, encryption quality, computation time, key sensitivity, entropy analysis, and key space analysis. We also analyze the computational costs of the encryption and decryption processes. The experimental results demonstrate that the proposed algorithms empirically yield satisfactory performance, exhibiting a near zero correlation between plaintext and ciphertext for most of test data, high encryption quality (over 80 percent), substantial key sensitivity, the large key space, and greater randomness in ciphertext compare to plaintext. The algorithm is efficient in terms of computational time and has linear complexity with respect to the number of input characters. The vast key space makes it highly impractical for brute-force approaches to find the decryption key directly.},
author = {Yunus, Mahmud, Firmansyah, Mohamad Ilham Dwi, Subiono, Kistosil Fahim},
journal = {Kybernetika},
keywords = {cryptography; lifting scheme; min-max-plus algebra; wavelet},
language = {eng},
number = {5},
pages = {576-602},
publisher = {Institute of Information Theory and Automation AS CR},
title = {A cryptography using lifting scheme integer wavelet transform over min-max-plus algebra},
url = {http://eudml.org/doc/299803},
volume = {60},
year = {2024},
}

TY - JOUR
AU - Yunus, Mahmud
AU - Firmansyah, Mohamad Ilham Dwi
AU - Subiono, Kistosil Fahim
TI - A cryptography using lifting scheme integer wavelet transform over min-max-plus algebra
JO - Kybernetika
PY - 2024
PB - Institute of Information Theory and Automation AS CR
VL - 60
IS - 5
SP - 576
EP - 602
AB - We propose a cryptographic algorithm utilizing integer wavelet transform via a lifting scheme. In this research, we construct some predict and update operators within the lifting scheme of wavelet transforms employing operations in min-max-plus algebra, termed as lifting scheme integer wavelet transform over min-max-plus algebra (MMPLS-IWavelet). The analysis and synthesis process on MMPLS-IWavelet is implemented for both encryption and decryption processes. The encryption key comprises a sequence of positive integers, where the first element specifies MMPLS-IWavelet type and subsequent elements indicate the levels of each executed transformation. The decryption key involves three components: the original encryption key, a binary encoding of the analyzed signal, and a sequence of non-negative integer representing the length of coefficient signals from the approximation and detail signals. We present a rigorous analysis confirming the correctness of the proposed cryptographic scheme, and evaluate its performance based on various metrics such as correlation value between plaintext and ciphertext, encryption quality, computation time, key sensitivity, entropy analysis, and key space analysis. We also analyze the computational costs of the encryption and decryption processes. The experimental results demonstrate that the proposed algorithms empirically yield satisfactory performance, exhibiting a near zero correlation between plaintext and ciphertext for most of test data, high encryption quality (over 80 percent), substantial key sensitivity, the large key space, and greater randomness in ciphertext compare to plaintext. The algorithm is efficient in terms of computational time and has linear complexity with respect to the number of input characters. The vast key space makes it highly impractical for brute-force approaches to find the decryption key directly.
LA - eng
KW - cryptography; lifting scheme; min-max-plus algebra; wavelet
UR - http://eudml.org/doc/299803
ER -