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

Access Full Text

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

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

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.

Inspec keywords: statistical analysis; chaos; cryptography

Other keywords: chaotic key stream; cycle length; statistical properties; chaotic dynamics; perturbance-based algorithm; cryptography systems

Subjects: Codes; Data security

References

    1. 1)
      • G. Heidari-Bateni , C.D. McGillem . A chaotic direct-sequencespread-spectrum communication system. IEEE Trans. Commun. , 1524 - 1527
    2. 2)
      • D.D. Wheeler , R.A. Matthews . Supercomputer investigationsof a chaotic encryption algorithm. Cryptologia , 140 - 152
    3. 3)
      • Schuneier . (1994) Applied cryptography.
    4. 4)
      • R. Matthews . On the derivation of a chaotic encryption algorithm. Cryptologia , 29 - 42
    5. 5)
      • Z. Hong , L. Xieting . Generating chaotic secure sequences withdesired statistical properties and high security. Int. BifurcationChaos , 1 , 205 - 213
    6. 6)
      • T. Lin , L.O. Chua . On chaos of digital filters in the real word. IEEE Trans. Circuits Syst. , 5 , 557 - 558
    7. 7)
      • T. Kohda , A. Tsuneda . Pseudonoise sequences by chaoticnonlinear maps and their correlation properties. IEICE Trans.Commun. , 8 , 855 - 862
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19980680
Loading

Related content

content/journals/10.1049/el_19980680
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading