By Topic

An Asynchronous Encryption Arithmetic Based on Laguerre Chaotic Neural Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ajin Zou ; Inf. Coll., Guangdong Ocean Univ., Zhanjiang, China ; Xiuchun Xiao

Based on best square approximation theory, new feed-forward neural networks are introduced where hidden units activation functions employ Laguerre orthogonal polynomials. Use these neural networks as the identifier model of the chaotic time series. Then, by varying the chaotic initial value and inputting to the networks, can produce new chaotic series, which are close to the theoretical values. We extract a subsequence as same length as the plaintext from the chaotic series and sort it. At last, by permuting the plaintext according to the sorted results of the subsequence, we can achieve the ciphertext. In the encryption system, the security of it depends completely on the complexity and unpredictability of the chaos. Especially, by varying the chaotic initial value, we can implement asynchronous "one-time pad cipher" encryption. The theoretical analysis and encryption instances proved that our arithmetic is useful, simple and high security, and it also has many advantages that a synchronous system can never achieve.

Published in:

2009 WRI Global Congress on Intelligent Systems  (Volume:4 )

Date of Conference:

19-21 May 2009