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

Volume: 34, Issue: 9, Pages: 873 - 874
Published: Apr 30, 1998
Abstract
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...
Paper Details
Title
Perturbance-based algorithm to expand cycle length of chaotic key stream
Published Date
Apr 30, 1998
Volume
34
Issue
9
Pages
873 - 874
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.