Chaos-based diffusion for highly autocorrelated data in encryption algorithms

Ahmad, Jawad; Hwang, Seong Oun

Abstract

In a single substitution box, the same regions (pixels) of an image are encrypted to one unique symbol. To reduce this type of autocorrelation in data, chaos has been extensively applied over the last decade. By using chaotic maps, a single substitution box has been replaced with multiple substitution boxes for the encryption of autocorrelated data. The technique of multiple substitution boxes is becoming very popular among cryptographic algorithm designers to overcome the drawbacks of a single substitution box. In this paper, however, we found that replacing a single substitution box with multiple substitution boxes cannot provide a general solution for highly autocorrelated data. To address this issue, we propose a novel technique by adding chaotic diffusion to the existing substitution process. Extensive security analyses show that the proposed algorithm achieves both higher-level security and fast encryption time when compared with existing algorithms.

Citation

Ahmad, J., & Hwang, S. O. (2015). Chaos-based diffusion for highly autocorrelated data in encryption algorithms. Nonlinear Dynamics, 82(4), 1839-1850. https://doi.org/10.1007/s11071-015-2281-0

• Journal Article Type: Article
• Acceptance Date: Jul 14, 2015
• Online Publication Date: Jul 27, 2015
• Publication Date: Jul 27, 2015
• Deposit Date: Sep 13, 2019
• Print ISSN: 0924-090X
• Electronic ISSN: 1573-269X
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 82
• Issue: 4
• Pages: 1839-1850
• DOI: https://doi.org/10.1007/s11071-015-2281-0
• Keywords: Chaos; Substitution; Diffusion; Cryptography; Image encryption
• Public URL: http://researchrepository.napier.ac.uk/Output/2133472