Correlation Analysis of Summation Generator
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [12]
  • |
  • Related [20]
  • | | |
  • Comments
    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.

    Reference
    [1]Siegenthaler T. Correlation immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, 1984,IT-30(9):776~780.
    [2]Siegenthaler T. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers, 1985,C-34(1):81~85.
    [3]Meier W, Staffelbach O. Nonlinear criteria for cryptographic functions. In: Advances in Cryptology-Eurocrypt'89. Berlin: Springer-Verlag, 1990. 549~562.
    [4]Meier W, Staffelbach O. Fast correlation attacks on certain stream ciphers. Journal of Cryptology, 1989,1(3):159~176.
    [5]Chepyzhov V, Smeets B. On a fast attack on stream ciphers. In: Advances in Cryptology-Eurocrypt'91. Lecture Notes in Computer Science. Vol. 547, Berlin: Springer-Verlag, 1991. 176~185.
    [6]Rueppel RA. Correlation immunity and the summation generator. In: Advances in Cryptology-Crypto'86. Berlin: Springer-Verlag, 1986. 260~272.
    [7]Meier W, Staffelbach O. Correlation properties of combiner with memory in stream cipher. Journal of Cryptology, 1992,15:67~86.
    [8]Staffelbach O, Meier W. Cryptographic significance of the carry for ciphers based on integer addition. In: Advances in Cryptology-Crypto'90. Lecture Notes in Computer Science, Vol.537, Berlin: Springer-Verlag, 1991. 601~614.
    [9]Golic JD, Salmasizadeh M, Dawson E. Fast correlation attack on the summation generator. Journal of Cryptology, 2000,13: 245~262.
    [10]Dawson E, Clark A. Divide and conquer attacks on certain classes of stream ciphers. Cryptologia, 1994,18(1):25~40.
    [11]Klapper A, Goresky M. Cryptanalysis based on 2-adic rational approximation. In: Advances in Cryptology-Crypto'95. Lecture Notes in Computer Science, Vol.963, Berlin: Springer-Verlag, 1995. 262~273.
    [12]Golic JD. Correlation properties of a general binary combiner with memory. Journal of Cryptology, 1996,9:111~126.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

冯登国,马卫局.求和生成器的相关性分析.软件学报,2003,14(8):1463-1469

Copy
Share
Article Metrics
  • Abstract:4376
  • PDF: 5161
  • HTML: 0
  • Cited by: 0
History
  • Received:April 10,2002
  • Revised:September 06,2002
You are the first2045272Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063