By Topic

Perturbance-based algorithm to expand cycle length of chaotic key stream

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 $33
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

3 Author(s)
Sang Tao ; Inst. of Tech. Phys., Acad. Sinica, Shanghai, China ; Wang Ruli ; Yan Yixun

The authors propose an algorithm based on a class of perturbance to solve the short cycle problem for chaotic cryptography systems. The lower bound of the extended cycle length can be specified theoretically, and the original good statistical properties of chaotic dynamics can be maintained

Published in:

Electronics Letters  (Volume:34 ,  Issue: 9 )