Abstract
We have proposed a chaotic cryptographic scheme based on iterating the logistic map and updating the look-up table dynamically. However, it has been broken recently. In this paper, the weaknesses of the original dynamic look-up table scheme are analyzed and a more secure chaotic encryption scheme based on this dynamic look-up table concept is proposed. Theoretical analysis indicates that the modified scheme can resist the reported attacks. Moreover, simulation results show that this encryption scheme leads to a flat ciphertext distribution.
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.
