基于logistic混沌序列的改进算法及其性能分析

针对目前混沌系统数字化后受硬件有限精度的影响，使得数字混沌0/1序列最终都将变成类短周期序列，降低了混沌加密系统的安全性。为克服此缺点本文将logistic混沌序列与Arnold变换相结合，提出了一种新型的logistic混沌序列算法，并通过实验对该算法产生的二值序列的自相关性、随机性等性能做了对比分析。同时利用此改进算法对数字图像进行加解密，结果表明新型的logistic混沌序列算法具有良好的安全性，能够满足保密通信的需要。

Design and Performance Analysis for Improved Algorithm Based on Logistic Chaotic Binary Sequences

Aiming at machine with finite precision would make digital chaotic binary sequences into similar short period sequences so that it lowers the security of chaotic encryption system for the problem. This paper proposed an improved algorithm of Logistic chaotic sequences, and it overcomes the shortcoming by combining Logistic chaotic sequences with Arnold transformation. Besides, the paper did some comparative experiments about autocorrelation and randomness of new binary sequences. Moreover, Digital image is encrypted and decrypted through this improved algorithm in the experiment, the results indicate that the new algorithm of Logistic chaotic sequences has a good performance on safety and has the ability to meet the requirements of confidential communication.