Abstract
We analyze the security and performance of two recently proposed encryption algorithms designed using deterministic chaotic dynamical systems. The analysis shows not only that the encryption rates of these algorithms are not competitive to the encryption rates of the standard algorithms, but that the algorithms can be easily broken using known-plaintext attack.
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.
