密码随机发生器中的元胞自动机
Cellular Automata in Cryptographic Random Generators
摘要：
至少从1985年开始，人们就提出了使用一维三邻域元胞自动机作为原语的密码方案。早期的结果显示了良好的统计伪随机性，其构造的简单性使其成为用于密码应用的自然候选者。自元胞自动机的那些早期以来，密码学领域的研究已经开发出一套工具，其允许设计者证明特定方案与解决充分研究的问题的实例一样困难，从而表明该方案的安全性水平。然而，很少或没有文献可用于这些细胞自动机是否可以被证明是安全的，即使是慷慨的假设。事实上，许多文献都没有提供完整的、可测试的方案来进行这样的分析。在这篇论文中，我们首先研究了元胞自动机作为构建密码原语的原语的适用性。在这项工作中，我们重点关注伪随机位生成和不可逆性，这是密码学的行为核心。特别是，我们专注于循环的线性和非线性的自动机，在一些常见的配置中可以在文献中找到。我们研究已知的攻击对这些结构，并在某些情况下，改善的结果。发现很少的证据证明安全性，然后，我们研究是否可以保持理想的性能的细胞自动机（即高度并行，简单的建设）作为自动机增强，提供了这样的证明的基础。这项调查导致我们的有限状态元胞自动机（FSCA），这是NP-难反演的一个新的建设。最后，我们介绍了鸿沟伪随机发生器的家庭建立在这个结构，并提供了一些初步的实验结果，使用NIST测试套件。
英文摘要：
Cryptographic schemes using one-dimensional, three-neighbor cellular automata as a primitive have been put forth since at least 1985. Early results showed good statistical pseudorandomness, and the simplicity of their construction made them a natural candidate for use in cryptographic applications. Since those early days of cellular automata, research in the field of cryptography has developed a set of tools which allow designers to prove a particular scheme to be as hard as solving an instance of a well- studied problem, suggesting a level of security for the scheme. However, little or no literature is available on whether these cellular automata can be proved secure under even generous assumptions. In fact, much of the literature falls short of providing complete, testable schemes to allow such an analysis. In this thesis, we first examine the suitability of cellular automata as a primitive for building cryptographic primitives. In this effort, we focus on pseudorandom bit generation and noninvertibility, the behavioral heart of cryptography. In particular, we focus on cyclic linear and non-linear au- tomata in some of the common configurations to be found in the literature. We examine known attacks against these constructions and, in some cases, improve the results. Finding little evidence of provable security, we then examine whether the desirable properties of cellular automata (i.e. highly parallel, simple construction) can be maintained as the automata are enhanced to provide a foundation for such proofs. This investigation leads us to a new construction of a finite state cellular automaton (FSCA) which is NP-Hard to invert. Finally, we introduce the Chasm pseudorandom generator family built on this construction and provide some initial experimental results using the NIST test suite.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
