﻿ 基于数字黑洞的密码算法

# 基于数字黑洞的密码算法Cryptographic Algorithm Based on Digital Black Hole

Abstract: Due to the use of long random key and random output with no statistical relationship between the plaintext, the security of one-time pad plan is very high and cannot be decoded. But the key can be used only once, otherwise it gave attackers a gap from the frequency, and the key is too long to pass or save safely. To the defects of one-time pad, this paper puts forward an algorithm based on the law that any four digit positive integer (Not all the same four figures) will return to a constant number 6174 for up to 7 steps after rearrangement for subtraction, so to the given plaintext and the given key, the ciphertext can be different every time, thus, a string of key can be circularly used for a couple of times which contributes to relieve one-time pad’s inherent de-fects in part.

[1] 王勇. 一次一密的安全性与新保密体制[J]. 信息网络安全, 2004(43): 41-43.

[2] 范畅, 茹鹏. 非线性一次一密(t,n)门限秘密共享方案[J]. 计算机应用, 2013, 33(9): 2536-2539.

[3] 潘江游, 杨理. 基于一次一密的量子身份识别方案[J]. 中国科学院研究生院学报, 2012(3): 277-281.

[4] 黄振国. 黑洞数的性质与它神奇的衍生法[J]. 广西大学梧州分校学报, 2004(1): 62-64.

[5] 杨之, 张忠辅. 角谷猜想和黑洞数问题的图论表示[J]. 自然杂志, 1988(6): 453-456.

[6] 王传彪. 黑洞研究中的数学方法[D]: [硕士学位论文]. 吉林: 吉林大学, 2011.

[7] 王子成, 赵晓航, 王宏. 基于DNA密码的一次一密加密算法[J]. 计算机工程与应用, 2014(15): 97-100.

[8] 田国胜, 杨昆, 张民. 类似一次一密的复合混沌音频隐藏方案[J]. 中国安全科学学报, 2009(4): 97-101.

[9] Zhang, Y.A. and Feng, D.G. (2005) A Practial One-Time Pad Like Block Cipher Scheme. 2, 101-104.

[10] Huang, Y.H., Hu, A.Q. and Song, Y.B. (2004) A Study on the One-Time Pad Algorithm and Its Implemetation. 3, 287- 290.

Top