Improved Generalized Birthday Attack
Improved Generalized Birthday Attack
复制标题
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
P. Kirchner
中科院分区：
文献类型：
--
作者：
P. Kirchner
设r、B、w为正整数。设C是长度为BW的线性码，是F2的子空间。K-正则译码问题是指寻找一个由w个汉明重量为k的B块组成的非零码字。这个问题主要是在2002年以后研究的。不能解决这个问题对密码学来说是至关重要的，因为它会快速攻击FSB、SWIFFT和学习带噪声的奇偶校验。在本文中，经典方法被用在相同的算法中，并且
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of F2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks with Hamming weight k. This problem was mainly studied after 2002. Not being able to solve this problem is critical for cryptography as it gives a fast attack against FSB, SWIFFT and learning parity with noise. In this paper, the classical methods are used in the same algorithm and