基于四维混沌系统生成二值序列的新方法及其加密应用-应用数学专业论文.docxVIP

汕 头 汕 头 大 学 硕 士 学 位 论 文 PAGE PAGE III Abstract In 1989, Matthews was the first one to apply discrete dynamic systems to image encryption[1]. He proposed a one-dimensional chaotic map, and used it to generate pseudo-random sequences with chaotic characteristics. Then, these sequences were applied in the one-timepad encryption algorithms. Nowadays, it has become a common approach to use chaotic maps to generate chaotic sequences, and convert the chaotic sequences into binary sequences, finally per- form the operation of XOR between the binary sequences and the plain text. This approach has been widely used because of its high efficiency and conve- nience. However, from a safety point of view, this encryption approach demands that the binary sequences have a good performance. The binary sequences should have a high degree of pseudo-random, and they should be able to meet the three random postulates of Golomb. Only in this way can it guarantee the attackers have greater difficulty in deciphering encrypted images. When con- verting chaotic sequences to binary sequences, there are lots of approaches now. In [2], [3], [4], the interval of the chaotic sequences was simply divided, and the chaotic sequences were quantified into 0, 1 binary sequences. The methods of [5], [6] were comparative ones, that is, the chaotic sequences were compared to the average or median, and they were quantified into binary sequences according to the result of the comparison. While, in [6], a binary sequences were obtained by comparing two chaotic sequences. Though simple, and easy to operate, these approaches were very strict to the chaotic systems, and they did not adequately meet the three random postulates of Golomb. In this thesis, a 4-D chaotic system is used to generate chaotic sequences, and a novel approach is proposed to convert these chaotic sequences into binary sequences. The generating binary sequences have good pseudo-randomness and they are quite sensitive to the initial values