Abstract
In this paper, the problem of chaotic secure communication is addressed from an iterative learning perspective, where the plaintext spans over a pre-specified finite-time interval. In the cryptographic scheme, the plaintext is modulated through chaotic parameter modulation, and then chaotically masked by a nonlinear mechanism. An efficient learning algorithm is exploited for decryption, and the sufficient convergence condition is derived by which the learning gain can be chosen. Furthermore, two fundamental techniques are given in order to enhance security. Case studies are carried out to demonstrate the effectiveness of the proposed method.
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.
