Abstract
A novel public key encryption technique based on multiple chaotic systems has been proposed. This scheme employs m-chaotic systems and a set of linear functions for key exchange over an insecure channel. The security of the proposed algorithm grows as (NP)m, where N, P are the size of the key and the computational complexity of the linear functions, respectively. In this paper, the fundamental weakness of the cryptosystem is pointed out and a successful attack is described. Given the fact that any complex linear transformations on a vector will make the norm of the vector approximate linear growth, we present an attack that permits recovering the corresponding secret key from the public key and the initial value. Both theoretical and experimental results show that the attacker can access the secret key without any difficulty. The lack of security discourages the use of such algorithm for practical applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.