| 摘要: |
| J. Dj. Golic运用线性序列电路逼进的方法来分析具有任意个输入的求和生成器.他猜想可以通过这种方法来获得所有具有最大相关系数的输入和输出线性函数对,但是他未给出证明.利用Walsh变换技术证明了当n是偶数的时候这个猜想成立.另外,还研究了求和生成器的相关系数总和,发现它与带1比特组合器的相关系数总和非常类似. |
| 关键词: 求和生成器 相关系数 记忆 流密码 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Grand Fundamental Research 973 Program of China under Grant No.G1999035802 (国家重点基础研究发展规划(973)); the National Science Foundation of China for Distinguished Young Scholars under Grant No.60025205 (国家杰出青年科学基金) |
|
| Correlation Analysis of Summation Generator |
|
FENG Deng-Guo,MA Wei-Ju
|
| Abstract: |
| Dj. Golic applied linear sequential circuit approximation (LSCA) method to analyze the summation generator with an arbitrary number of inputs. He conjectured that he could obtain all pairs of mutually correlated input and output linear functions with the maximum possible absolute value of the correlation coefficient by this method, but he did not give any proof. By using Walsh Transformation technique, the conjecture is proved for even n in this paper. The "total correlation" of summation generator is studied which is very similar to that of combiners with one bit memory. |
| Key words: summation generator correlation coefficient memory stream cipher |
