基于搜索机制混沌加密算法的密文特性分析

葛辛; 刘粉林; 芦斌; 陈娟

doi:10.3724/SP.J.1146.2006.01992

基于搜索机制混沌加密算法的密文特性分析

doi: 10.3724/SP.J.1146.2006.01992

基金项目:

国家自然科学基金(60374004)，河南省杰出青年基金(0412000200)，国家863项目( 2006AA01Z409)和河南省06科技攻关项目资助课题

计量
- 文章访问数: 3635
- HTML全文浏览量: 119
- PDF下载量: 834
- 被引次数: 0
出版历程
- 收稿日期: 2006-12-18
- 修回日期: 2007-06-08
- 刊出日期: 2008-07-19

Analysis for the Cipherext Characteristic of Based on Search Mechanism Chaotic Cryptosystem

摘要

摘要: 针对Baptista提出的混沌加密算法及其改进算法中的密文过长及0,1比例不均匀的问题,该文通过计算密文的信息熵,给出了密文明文比例期望的下界;然后运用文中所提出的N-截断等长编码和最优N-截断等长编码等概念描述了编码方式与密文明文比例之间的关系,给出了0,1比例的近似计算公式。算例分析表明最优N-截断等长编码可有效缩短密文长度,提高0,1比例的均匀度。
- 混沌加密; 信息熵; 最优N-截断等长编码
Abstract: In order to solve the two major drawbacks of Baptistas chaotic cryptosystem and its modified versionsexcessive length of ciphertext and unbalance ratio of bit 0 to bit 1, this paper gives the lower bound of the expectation of the cipher N-to-plaintext ratio by calculating the entropy of the ciphertext. Then exploiting truncated equal length coding, the optimal truncated equal length coding and so on, this paper describes the relationship between coding and cipher N-to-plaintext ratio, and proposes the approximate formula to work out the ratio of bit 0 to bit 1. Numerical paradigms show that the optimal truncated equal length coding can efficiently shorten the length of ciphertext and obtain more uniform ratio of bit 0 to bit 1.

HTML全文

参考文献(1)

Baptista M S. Cryptography with chaos[J].Physics Letters A.1998, 240(1/2):50-54[2]Wong W K, Lee L P, and Wong K W. A modified chaoticcryptographic method[J].Comp Phys Comm.2001, 138(3):234-236[3]Palacios A and Juarez H. Cryptography with cycling chaos[J].Physics Letters A.2002, 303(5/6):345-351[4]Wong K W. A fast chaotic cryptographic scheme withdynamic look up table[J].Physics Letters A.2002, 298(4):238-242[5]Wong K W, Ho S W, and Yung C K. A chaotic cryptographyscheme for generating short ciphertext[J].Physics Letters A.2003, 310(1):67-73[6]Wong K W. A combined chaotic cryptographic and hashingscheme[J].Physics Letters A.2003, 307(5/6):292-298[7]Li S J, Mou X Q, Ji Z, and Zhang J, et al.. Performanceanalysis of Jakimoski-Kocarev attack on a class of chaoticcryptosystems[J].Physics Letters A.2003, 307(1):22-28[8]Li S J, Chen G R, Wong K W, and Mou X Q, et al.. Baptista-type chaotic cryptosystems: Problems and countermeasures[J].Physics Letters A.2004, 332, (5/6):368-375[9]Wong K W, Man K P, and Li S J, et al.. A more securechaotic cryptographic scheme based on dynamic look-uptable[J].Circuits, Systems Signal Processing.2005, 24(5):571-584[10]Wei J, Liao X F, and Wong K W, et al.. Analysis andimprovement for the performance of Baptistas cryptographicscheme[J].Physics Letters A.2006, 354(1-2):101-109[11]Jokimoski G and Kocarev L. Analysis of some recentlyproposed chaos-based encryption algorithm[J].Physics LettersA.2001, 291(6):381-384[12]aacute;lvarez G, Montoya F, Romera M, and Pastor G.Cryptanalysis of dynamic look-up table based chaoticcryptosystems[J].Physics Letters A.2004, 326(3/4):211-218[13]Chen Y and Liao X F. Cryptanalysis on a modifiedBaptista-type cryptosystem with chaotic masking algorithm[J].Physics Letters A.2005, 342(5/6):389-396[14]Shanon C E. Communication theory of secrecy systems. BellSys Tech J, 1949, 28(4): 656-715.[15]李红达, 冯登国. 基于复合离散混沌动力系统的序列密码算法. 软件学报, 2003, 14(5): 991-998.Li H D and Feng D G. Stream cipher algorithms based oncomposite nonliner discrete chaotic dynamical systems.Journal of Software, 2003, 14(5): 991-998.[16]胡汉平, 刘双红, 王祖喜等. 一种混沌密钥流产生方法. 计算机学报, 2004, 27(3): 408-412.Hu H P, Liu S H, and Wang Z X, et al.. A Method forgenerating chaotic key stream. Chinese Journal ofComputer, 2004, 27(3): 408-412.[17]IEEE Computer Society. IEEE standard for binaryfloating-point arithmetic, ANSI/IEEE Std 754-1985 (August1985).

施引文献

资源附件(0)

访问统计