|
|
|
A one-time one-key encryption algorithm based on the ergodicity of chaos |
| Wang Xing-Yuan(王兴元)† and Teng Lin(滕琳)‡ |
| Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024, China |
|
|
|
|
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.
|
Received: 04 July 2011
Revised: 11 August 2011
Accepted manuscript online:
|
|
PACS:
|
05.45.-a
|
(Nonlinear dynamics and chaos)
|
| |
05.45.Gg
|
(Control of chaos, applications of chaos)
|
|
| Fund: 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). |
Corresponding Authors:
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
|
Cite this article:
Wang Xing-Yuan(王兴元) and Teng Lin(滕琳) A one-time one-key encryption algorithm based on the ergodicity of chaos 2012 Chin. Phys. B 21 020504
|
| [1] |
Wang X Y and Gao Y F 2010 Nonlinear Sci. Numer. Simulat. 15 99
|
| [2] |
Ashraf A. Z and Abdulnasser A R 2011 Nonlinear Sci. Numer. Simulat. 16 3721
|
| [3] |
Liu Z B, Zhang H G and Sun Q Y 2010 Chin. Phys. B 19 090506
|
| [4] |
Zhang H G, Ma T D, Fu J and Tong S C 2009 Chin. Phys. B 18 3742
|
| [5] |
Zhang H G, Ma T D, Yu W and Fu J 2008 Chin. Phys. B 17 3616
|
| [6] |
Long M, Peng F and Chen G R 2008 Chin. Phys. B 17 3588
|
| [7] |
Wang K, Pei W J, Zou L H and He Z Y 2006 Acta Phys. Sin. 55 6243 (in Chinese)
|
| [8] |
Baptista M S 1998 Phys. Lett. A 240 50
|
| [9] |
Wong W K, Lee L P and Wong K W 2001 Comput. Phys. Commun. 138 234
|
| [10] |
Wong K W 2002 Phys. Lett. A 298 238
|
| [11] |
Wong K W 2003 Phys. Lett. A 307 292
|
| [12] |
Wong K W, Ho S W and Yung C K 2003 Phys. Lett. A 310 67
|
| [13] |
Jakimoski G and Kocarev L 2001 Phys. Lett. A 291 381
|
| [14] |
Wang Y, Liao X F, Xiang T, Wong K W and Yang D G 2007 Phys. Lett. A 363 277
|
| [15] |
Rhouma R, Solak E, Arroyo D, Li S J, Alvarez G and Belghith S 2009 Phys. Lett. A 373 3398
|
| [16] |
Kocarev L and Jakimoski G 2001 Phys. Lett. A 289 200
|
| [17] |
Alvarez G and Li S 2006 Int. J. Bifurc. Chaos 16 2129
|
| [18] |
Pareek N K, Patidar V and Sud K K 2005 Nonlinear Sci. Numer. Simulat. 10 715
|
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|
