摘要
保障信息安全最有效的方法就是对信息进行加密,然而目前大部分使用的加密算法如AES算法,IDEA算法等都是由国外开发,技术一直被国外机构垄断,安全性无法得到很好保证。针对这一问题,文章提出了一种基于欧拉回路序列的加密算法,该算法未采用位运算,而是基于欧拉回路序列加密原理,在给定进制范围内动态生成数与数的一一映射,以此进行全范围的字节替换;算法支持细粒度可变密钥长度,密钥长度由欧拉图的节点数决定。测试表明本算法具有很好的统计特性,可抵抗各种攻击。
The most effective way to assure information security is to encrypt it. However, most of the practical algorithm, such as AES and IDEA, are invented abroad and the techniques have always been monopolized overseas. So information security cannot be guaranteed. As to this problem, we put forward a new type of encryption algorithm which is based on Euler loop sequence. The algorithm does not use bit operations but based on the encryption principle of Euler loop sequence. It generates the one-one mapping between numbers dynamically in the given into system range, thus it can replace the full range of bytes. The algorithm supports fine-grained variable length key, which is determined by the number of nodes of Euler Diagram. Experiments show that this algorithm has good statistical character and it is robust to many attacks.
出处
《信息网络安全》
2013年第3期29-33,共5页
Netinfo Security
基金
国家自然科学基金[61103191]
关键词
信息安全
欧拉回路序列
加密算法
information security
Euler loop sequence
encryption algorithm