arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.00410cs.CR
收藏

伪随机序列计算加固的二元素数序列

The binary primes sequence for computational hardening of pseudorandom sequences

B. Prashanth Reddy, Subhash Kak

摘要:

本文提出了利用二进制素数序列来增强伪随机(PN)十进制序列的密码学应用。二进制素数序列添加到PN十进制序列(其中可以选择从许多任意的移位值),它示出的总和序列具有改善的自相关特性,除了是计算困难。此外,对计算复杂性进行了分析,它表明,窃听的复杂性是指数复杂性,因此,所提出的方法是一个有吸引力的程序的密码应用。

英文摘要:

This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the computational complexity is performed and it is shown that the complexity for the eavesdropper is of exponential complexity and therefore, the proposed method is an attractive procedure for cryptographic applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑