MV3：一种新的基于快速混合和循环缓冲区的字流密码
MV3: A new word based stream cipher using rapid mixing and revolving buffers
摘要：
MV 3是一种新的基于字的流密码，用于加密长数据流。将基于字节的密码（如RC 4）直接适配为32位或64位字的版本显然需要大量的内存。这个缩放问题需要寻找新的组件和原理，以及数学分析来证明它们的使用。我们的方法，像RC 4的，是基于快速混合有向图上的随机游动（即，从任何起点快速到达随机状态的游动）。我们从一些很好理解的步骤开始，然后在它们的步骤中引入非线性，以提高安全性，并表明长期的统计相关性可以忽略不计。为了最大限度地减少短期相关性，以及阻止使用涉及连续输出的方程的攻击，我们提供了一种方法，用于使用三个旋转缓冲区对从行走中获得的输出进行排序。该密码是快速的-它在奔腾IV处理器上以每字节不到5个周期的速度运行。基于字的密码需要每步输出更多的比特，这暴露了更多的攻击相关性。此外，我们寻求简单的建设和透明的分析。为了满足这些要求，我们使用了一个更大的状态，并声称安全性对应于它的一小部分。我们的设计是一个足够安全的字为基础的密码;我们非常初步的估计把安全性接近穷举搜索大小< 256位的密钥。
英文摘要：
MV3 is a new word based stream cipher for encrypting long streams of data. A direct adaptation of a byte based cipher such as RC4 into a 32- or 64-bit word version will obviously need vast amounts of memory. This scaling issue necessitates a look for new components and principles, as well as mathematical analysis to justify their use. Our approach, like RC4's, is based on rapidly mixing random walks on directed graphs (that is, walks which reach a random state quickly, from any starting point). We begin with some well understood walks, and then introduce nonlinearity in their steps in order to improve security and show long term statistical correlations are negligible. To minimize the short term correlations, as well as to deter attacks using equations involving successive outputs, we provide a method for sequencing the outputs derived from the walk using three revolving buffers. The cipher is fast -- it runs at a speed of less than 5 cycles per byte on a Pentium IV processor. A word based cipher needs to output more bits per step, which exposes more correlations for attacks. Moreover we seek simplicity of construction and transparent analysis. To meet these requirements, we use a larger state and claim security corresponding to only a fraction of it. Our design is for an adequately secure word-based cipher; our very preliminary estimate puts the security close to exhaustive search for keys of size < 256 bits.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
