软件学报
軟件學報
연건학보
JOURNAL OF SOFTWARE
2003年
8期
1463-1469
,共7页
求和生成器%相关系数%记忆%流密码
求和生成器%相關繫數%記憶%流密碼
구화생성기%상관계수%기억%류밀마
summation generator%correlation coefficient%memory%stream cipher
J. Dj. Golic运用线性序列电路逼进的方法来分析具有任意个输入的求和生成器.他猜想可以通过这种方法来获得所有具有最大相关系数的输入和输出线性函数对,但是他未给出证明.利用Walsh变换技术证明了当n是偶数的时候这个猜想成立.另外,还研究了求和生成器的相关系数总和,发现它与带1比特组合器的相关系数总和非常类似.
J. Dj. Golic運用線性序列電路逼進的方法來分析具有任意箇輸入的求和生成器.他猜想可以通過這種方法來穫得所有具有最大相關繫數的輸入和輸齣線性函數對,但是他未給齣證明.利用Walsh變換技術證明瞭噹n是偶數的時候這箇猜想成立.另外,還研究瞭求和生成器的相關繫數總和,髮現它與帶1比特組閤器的相關繫數總和非常類似.
J. Dj. Golic운용선성서렬전로핍진적방법래분석구유임의개수입적구화생성기.타시상가이통과저충방법래획득소유구유최대상관계수적수입화수출선성함수대,단시타미급출증명.이용Walsh변환기술증명료당n시우수적시후저개시상성립.령외,환연구료구화생성기적상관계수총화,발현타여대1비특조합기적상관계수총화비상유사.
J. 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.