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

在加密中使用重复小数作为素数的替代

Using Repeating Decimals As An Alternative To Prime Numbers In Encryption

Givon Zirkind

摘要:

本文旨在提供一个额外的观点,应用已知的知识,以一种通常不会想到的方式提供具有一系列不重复数字的密钥。传统上,素数在加密中用作具有非重复序列的密钥。密钥中的数字不重复在加密中是非常受欢迎的。数字序列中的唯一性使方法解密失败。在寻找不可解密的加密方法以及提供唯一序列的方法时,除了使用素数之外,我想到了使用重复小数的想法。正确应用,足够长的重复小数系列也可以代替素数。这是因为只有互素的数才会产生重复的小数,并且在重复序列中存在唯一的数字序列。

英文摘要:

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in encryption as keys that have non-repeating sequences. Non-repetition of digits in a key is very sought after in encryption. Uniqueness in a digit sequence defeats decryption by method. In searching for methods of non-decryptable encryption as well as ways to provide unique sequences, other than using prime numbers, the idea of using repeating decimals came to me. Applied correctly, a repeating decimal series of sufficient length will stand in as well for a prime number. This is so, because only numbers prime to each other will produce repeating decimals and; within the repeating sequence there is uniqueness of digit sequence.

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

↑