This paper presents a public key based chaotic cryptosystem for image encryption operating in the integer field. The system is based on the discrete Cat-Hadamard map to encrypt bitmap images based on bit plane decomposing processes. The Chebyshev polynomials are used to determine the parameters of the Cat-Hadamard map. We show that the scheme offers very good resistance against exhaustive attacks, statistical attacks, and differential attacks. In addition, the computational cost of the scheme is limited, leading to a valid candidate for lightweight cryptography.
Kim Hue, TT, Manh Hoang, T, Thanh, HX & Braeken, A 2018, Bit plane decomposing image encryption based on discrete cat-hadamard map. in 2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018., 8465711, 2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018, Institute of Electrical and Electronics Engineers Inc., pp. 344-349, 7th IEEE International Conference on Communications and Electronics, ICCE 2018, Hue, Viet Nam, 18/07/18. https://doi.org/10.1109/CCE.2018.8465711
Kim Hue, T. T., Manh Hoang, T., Thanh, H. X., & Braeken, A. (2018). Bit plane decomposing image encryption based on discrete cat-hadamard map. In 2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018 (pp. 344-349). Article 8465711 (2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CCE.2018.8465711
@inproceedings{898dd7fe2b49446a8e32defa121b82fc,
title = "Bit plane decomposing image encryption based on discrete cat-hadamard map",
abstract = "This paper presents a public key based chaotic cryptosystem for image encryption operating in the integer field. The system is based on the discrete Cat-Hadamard map to encrypt bitmap images based on bit plane decomposing processes. The Chebyshev polynomials are used to determine the parameters of the Cat-Hadamard map. We show that the scheme offers very good resistance against exhaustive attacks, statistical attacks, and differential attacks. In addition, the computational cost of the scheme is limited, leading to a valid candidate for lightweight cryptography.",
author = "{Kim Hue}, {Ta Thi} and {Manh Hoang}, Thang and Thanh, {Hoang Xuan} and An Braeken",
note = "Funding Information: ACKNOWLEDGMENT This research is funded by the Hanoi University of Science and Technology (HUST) under project number T2016-LN-11. Publisher Copyright: {\textcopyright} 2018 IEEE.; 7th IEEE International Conference on Communications and Electronics, ICCE 2018 ; Conference date: 18-07-2018 Through 20-07-2018",
year = "2018",
month = sep,
day = "13",
doi = "10.1109/CCE.2018.8465711",
language = "English",
series = "2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "344--349",
booktitle = "2018 IEEE 7th International Conference on Communications and Electronics, ICCE 2018",
address = "United States",
}