中国物理B ›› 2012, Vol. 21 ›› Issue (2): 20504-020504.doi: 10.1088/1674-1056/21/2/020504

• GENERAL • 上一篇    下一篇

王兴元,滕琳   

  • 收稿日期:2011-07-04 修回日期:2011-08-11 出版日期:2012-01-30 发布日期:2012-01-30
  • 通讯作者: 王兴元,wangxy@dlut.edu.cn;滕琳,tenglin@mail.dlut.edu.cn E-mail:wangxy@dlut.edu.cn;tenglin@mail.dlut.edu.cn

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

Wang Xing-Yuan(王兴元)† and Teng Lin(滕琳)‡   

  1. Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024, China
  • Received:2011-07-04 Revised:2011-08-11 Online:2012-01-30 Published:2012-01-30
  • Contact: Wang Xing-Yuan,wangxy@dlut.edu.cn;Teng Lin,tenglin@mail.dlut.edu.cn E-mail:wangxy@dlut.edu.cn;tenglin@mail.dlut.edu.cn
  • Supported by:
    Project 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), and the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165).

PDF (PC)

585

赞

Abstract: 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.

Key words: chaos, encryption, ergodicity

中图分类号:  (Nonlinear dynamics and chaos)

  • 05.45.-a
05.45.Gg (Control of chaos, applications of chaos)