Abstract
This paper deals with a plaintext-related image encryption algorithm that modifies the parameter values used by the logistic map according to plain image pixel intensities. The parameter values are altered in a row-wise manner, which enables the usage of the same procedure also during the decryption. Furthermore, the parameter modification technique takes into account knowledge about the logistic map, its fixed points and possible periodic cycles. Since the resulting interval of parameter values achieves high positive values of Lyapunov exponents, the chaotic behavior of the logistic map should be most pronounced. These assumptions are verified by a set of experiments and the obtained numerical values are compared with those reported in relevant papers. It is found that the proposed design that uses a simpler, but well-studied, chaotic map with mitigated issues obtains results comparable with algorithms that use more complex chaotic systems. Moreover, the proposed solution is much faster than other approaches with a similar purpose.
Highlights
IntroductionThe extension of various communication networks and the increasing amount of transmitted data in the late 1970s caused the need for modern encryption algorithms
Plaintext-Related Parameter Values.The extension of various communication networks and the increasing amount of transmitted data in the late 1970s caused the need for modern encryption algorithms
It is clearly visible that the proposed image encryption algorithm flattens the histogram; it is more difficult to extract some useful statistical information from the encrypted image
Summary
The extension of various communication networks and the increasing amount of transmitted data in the late 1970s caused the need for modern encryption algorithms. These algorithms were designed for operations with character strings, which allowed a wide spectrum of possible applications. Most of the research was related only to these algorithms and, since various alternatives were proposed much later, the first group of algorithms could be considered conventional algorithms. The amount of applications for conventional encryption algorithms was further enlarged by introducing new modes of operation for them. In certain cases, even these tools could not make conventional encryption algorithms useful. The research into dedicated encryption algorithms that could be utilized for some specific applications started
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
