计算机应用 ›› 2010, Vol. 30 ›› Issue (4): 1059-1063.

• 信息安全 • 上一篇    下一篇

二维化信息的三维化加密算法研究

徐艳山1,王国才2   

  1. 1. 湖南省衡阳市湖南工学院
    2.
  • 收稿日期:2009-08-16 修回日期:2009-10-17 发布日期:2010-04-15 出版日期:2010-04-01
  • 通讯作者: 徐艳山

Three-dimensional encryption algorithm for two-dimensional information

  • Received:2009-08-16 Revised:2009-10-17 Online:2010-04-15 Published:2010-04-01

摘要: 根据象棋的博弈原理而整理出一个全新的信息加密算法。在信息加密前,对所有可能用到的原始信息进行二维化处理,建立原始信息表。在信息加密时,找出明文在原始信息表中对应二维坐标的分量信息,再将这些二维信息按一定的规则对应存放在一个三维化表格中而形成密文。解密则按加密时信息存放的顺序取出信息即可。该算法建立了两套完全独立的密钥方案。在7进制数描述原始信息表的背景下,以7×7×2三维表格为例,将信息数字化二维处理,实验结果表明,该算法计算量少,速度较快,安全性高,得到的密钥数量多。

关键词: 原始信息表, 明文, 密文, 行信息, 列信息

Abstract: According to the principle of the chess game, a new encryption algorithm was developed. Before encrypting the information, process all the original information into two-dimension and establish the original information tables. And then find out 2D coordinate components of the plaintext in the tables, while encrypting. This two-dimensional information will be stored in a corresponding three-dimensional table to form cipher text, according to certain rules. According to the order of the information stored, the encrypted information can be deciphered. This algorithm founds two sets of cipher codes completely independent of each other. With 7 decimal number described in the context of the original information table, taking the 7×7×2 three-dimensional form for example, the algorithm was figured in detail. The algorithm, for the first time, uses two-dimensional digital processing on the information. The principle is easy to understand, in diversified forms, faster, and of less computing, higher security and large number of secret keys.

Key words: original information table, plaintext, ciphertext, line information, column information