A one-time one-key encryption algorithm based on the ergodicity of chaos  

作　　者：Wang Xing-Yuan Teng Lin 王兴元;腾琳(Faculty of Electronic Information and Electrical Engineering,Dalian University of Technology,Dalian 116024,China)

机构地区：[1]Faculty of Electronic Information and Electrical Engineering,Dalian University of Technology,Dalian 116024,China

出　　处：《Chinese Physics B》2012年第2期148-152,共5页中国物理B（英文版）

基　　金：supported by the National Natural Science Foundation of China (Grant Nos.61173183,60973152,and 60573172);the Superior University Doctor Subject Special Scientific Research Foundation of China (Grant No.20070141014);the Natural Science Foundation of Liaoning Province,China (Grant No.20082165)

摘　　要：In this paper, we propose a new one-time one-key encryption algorithm based on the ergodicity of a skew tent chaotic map. We divide the chaotic trajectory into sub-intervals and map them to integers, and use this scheme to encrypt plaintext and obtain ciphertext. In this algorithm, the plaintext information in the key is used, so different plaintexts or different total numbers of plaintext letters will encrypt different ciphertexts. Simulation results show that the performance and the security of the proposed encryption algorithm can encrypt plaintext effectively and resist various typical attacks.In this paper, we propose a new one-time one-key encryption algorithm based on the ergodicity of a skew tent chaotic map. We divide the chaotic trajectory into sub-intervals and map them to integers, and use this scheme to encrypt plaintext and obtain ciphertext. In this algorithm, the plaintext information in the key is used, so different plaintexts or different total numbers of plaintext letters will encrypt different ciphertexts. Simulation results show that the performance and the security of the proposed encryption algorithm can encrypt plaintext effectively and resist various typical attacks.

关 键 词：CHAOS ENCRYPTION ERGODICITY 

分 类 号：O415.5[理学—理论物理] TN918.1[理学—物理]