深度随机加密的实用实现
Towards Practical Implementation of Deep Random Secrecy
摘要：
我们以前已经介绍了深度随机保密，一种新的密码技术，能够确保保密接近理想的完美对无限的被动窃听对手。我们以前还介绍了一个扩展协议，基于深度随机加密，能够抵抗无限活跃的MITM。这些协议的主要限制，在他们最初的版本中，是需要在合法的合作伙伴之间交换的重要信息量，以提取安全数字。我们已经定义并证明了一个绝对常数的存在，称为密码极限，它代表了深度随机加密协议可以达到的加密速率的上限。最后，我们已经提出了从经典计算资源生成深度随机性的实用算法。本文提出了一种优化技术，基于重组和重用的随机位，这种技术能够显着提高以前引入的协议的带宽性能，而不会危及秘密信息的熵。这种优化使得能够以非常合理的成本设想深度随机加密的实现。文章还从全面实施的角度总结了前人的成果。
英文摘要：
We have formerly introduced Deep Random Secrecy, a new cryptologic technique capable to ensure secrecy as close as desired from perfection against unlimited passive eavesdropping opponents. We have also formerly introduced an extended protocol, based on Deep Random Secrecy, capable to resist to unlimited active MITM. The main limitation of those protocols, in their initial presented version, is the important quantity of information that needs to be exchanged between the legitimate partners to distill secure digits. We have defined and shown existence of an absolute constant, called Cryptologic Limit, which represents the upper-bound of Secrecy rate that can be reached by Deep Random Secrecy protocols. At last, we have already presented practical algorithms to generate Deep Randomness from classical computing resources. This article is presenting an optimization technique, based on recombination and reuse of random bits; this technique enables to dramatically increase the bandwidth performance of formerly introduced protocols, without jeopardizing the entropy of secret information. That optimization enables to envision an implementation of Deep Random Secrecy at very reasonable cost. The article also summarizes former results in the perspective of a comprehensive implementation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
