TY - GEN
T1 - Image Encryption
T2 - 8th International Arab Conference on Mathematics and Computations, IACMC 2023
AU - Rasool, Masrat
AU - Belhaouari, Samir Brahim
AU - Baali, Hamza
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.
PY - 2024/10/6
Y1 - 2024/10/6
N2 - This paper investigates using Collatz Conjecture as a cryptographic algorithm to address the increasing demand for secure information and data access. The proposed encryption method utilizes a hash function inspired by the Collatz Conjecture to achieve significant randomization while maintaining the input’s integrity. The encryption scheme recursively adds the hash function’s output to the neighbouring pixel value, resulting in a highly secure encryption process. Several metrics were used to evaluate the proposed method’s performance, and the findings show that it outperforms existing encryption algorithms regarding data protection and computational speed. The proposed approach was evaluated using a range of established metrics, including but not limited to encryption and decryption speed, memory usage, and resistance to attacks. The Collatz Conjecture provides a means to generate pseudo-random numbers that can serve as keys for encryption, offering a novel approach to encryption that can withstand new hacking techniques and technological advancements. In addition to addressing the need for secure data access, the proposed encryption method has applications in various fields, including medical and military imaging, where data privacy and security are crucial. The findings of this paper provide valuable insights into the potential of the Collatz Conjecture as a new cryptographic algorithm and contribute to the development of encryption techniques that can ensure secure communication and protect sensitive data.
AB - This paper investigates using Collatz Conjecture as a cryptographic algorithm to address the increasing demand for secure information and data access. The proposed encryption method utilizes a hash function inspired by the Collatz Conjecture to achieve significant randomization while maintaining the input’s integrity. The encryption scheme recursively adds the hash function’s output to the neighbouring pixel value, resulting in a highly secure encryption process. Several metrics were used to evaluate the proposed method’s performance, and the findings show that it outperforms existing encryption algorithms regarding data protection and computational speed. The proposed approach was evaluated using a range of established metrics, including but not limited to encryption and decryption speed, memory usage, and resistance to attacks. The Collatz Conjecture provides a means to generate pseudo-random numbers that can serve as keys for encryption, offering a novel approach to encryption that can withstand new hacking techniques and technological advancements. In addition to addressing the need for secure data access, the proposed encryption method has applications in various fields, including medical and military imaging, where data privacy and security are crucial. The findings of this paper provide valuable insights into the potential of the Collatz Conjecture as a new cryptographic algorithm and contribute to the development of encryption techniques that can ensure secure communication and protect sensitive data.
KW - Chaos
KW - Collatz Conjecture
KW - Encryption
UR - http://www.scopus.com/inward/record.url?scp=85206924467&partnerID=8YFLogxK
U2 - 10.1007/978-981-97-4876-1_25
DO - 10.1007/978-981-97-4876-1_25
M3 - Conference contribution
AN - SCOPUS:85206924467
SN - 9789819748754
T3 - Springer Proceedings in Mathematics and Statistics
SP - 357
EP - 382
BT - Mathematical Analysis and Numerical Methods - IACMC 2023
A2 - Burqan, Aliaa
A2 - Saadeh, Rania
A2 - Qazza, Ahmad
A2 - Ababneh, Osama Yusuf
A2 - Cortés, Juan C.
A2 - Diethelm, Kai
A2 - Zeidan, Dia
PB - Springer
Y2 - 10 May 2023 through 12 May 2023
ER -