其他摘要：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.
关键词：密码算法 ; 一次一密 ; 数字黑洞 ; 重排求差 ; Cryptographic Algorithm ; One-Time Pad ; Digital Black Hole ; Rearrangement Differencing
其他关键词：密码算法 ; 一次一密 ; 数字黑洞 ; 重排求差 ; Cryptographic Algorithm ; One-Time Pad ; Digital Black Hole ; Rearrangement Differencing
