The "one-group-one-cipher" cryptograph of block-cipher based on chaotic
|更新时间:2024-10-14
|
The "one-group-one-cipher" cryptograph of block-cipher based on chaotic
Vol. 30, Issue S2, Pages: 105-110(2009)
作者机构:
1. 国防科学技术大学计算机学院
2. 武警宁夏总队司令部
作者简介:
基金信息:
DOI:
CLC:TN918.1
Published:2009
稿件说明:
移动端阅览
XUAN Lei1, YAN Ji-ning1. The "one-group-one-cipher" cryptograph of block-cipher based on chaotic[J]. 2009, 30(S2): 105-110.
DOI:
XUAN Lei1, YAN Ji-ning1. The "one-group-one-cipher" cryptograph of block-cipher based on chaotic[J]. 2009, 30(S2): 105-110.DOI:
The "one-group-one-cipher" cryptograph of block-cipher based on chaotic
摘要
针对已有组合密码方案存在的弱密钥问题
提出了由混沌序列生成分组密码子密钥的"一组一密"密码方案
采用Shannon熵等方法验证了提取的密钥序列的随机性
基于超混沌广义Hénon映射和IDEA算法设计实现了"一组一密"算法
对算法安全性的理论分析表明:算法能够抵抗密钥穷举攻击
达到了完全保密系统的要求。该算法既消除了分组密码算法密钥在多组中重复使用的缺陷
又增加了混沌序列和一次一密的可行性。
Abstract
The"one-group-one-cipher"algorithm used the sequence from chaotic mapping as sub-key for block cipher was presented to solve the problem of weak keys existing in currently combined cipher algorithms.The randomness of abstracted key sequence was validated in aspects of Shannon entropy.The"one-group-one-cipher"algorithm was de-signed and implemented based on hyper-chaos generalized Hénon mapping and IDEA algorithms
and its security was analyzed theoretically.Analysis shows that the algorithm is so secure that it can withstand brute force attack
and it was perfect secrecy.The disadvantages of key’s reuse of block ciphers are avoided
and the practicality and feasibility of chaos ciphers and one-time pad are improved.