Abstract
Recently, a large number of chaotic cryptosystems have been proposed, many of them fundamentally flawed by lack of robustness and security. In this paper, we point out the weakness of a very recent block cipher algorithm which is based on the chaotic Hopfield neural networks with time varying delay and give the improved scheme of it. We provide the chosen plaintext attack to recover the permuted plaintext string, and point out that the encryption speed is not fast enough. It is shown that the dependence on the key, but not on the plaintext, to generate binary sequences of iterating the chaotic map mechanism facilitates leakage of the information and vulnerable been attacked. Based on such a fact, we give the improved scheme to obtain higher security and faster speed.
Sign-in/Register to access full text options 
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.
