Encyclopedia of Cryptography and Security

2005 Edition
| Editors: Henk C. A. van Tilborg

Summation generator

  • Caroline Fontaine
Reference work entry
DOI: https://doi.org/10.1007/0-387-23483-7_421
The summation generator is based on a combination of n Linear Feedback Shift Registers (LFSRs) and was first proposed in [ 5, 6]. The combining function is an addition over the set of integers. From a binary point of view, it is a nonlinear function, with maximum correlation immunity. The output bit is the least significant bit of the integer sum.
This is a preview of subscription content, log in to check access.

References

  1. [1]
    Dawson, E. (1993). “Cryptanalysis of summation generator.” Advances in Cryptology—ASIACRYPT'92, Lecture Notes in Computer Science, vol. 718, eds. J. Seberry and Y. Zheng. Springer-Verlag, Berlin, 209–215.Google Scholar
  2. [2]
    Golic, J., M. Salmasizadeh, and E. Dawson (2000). “Fast correlation attacks on the summation generator.” Journal of Cryptology, 13, 245–262.zbMATHMathSciNetGoogle Scholar
  3. [3]
    Klapper, A. and M. Goresky (1995). “Cryptanalysis based on 2-adic rational approximation.” Advances in Cryptology—CRYPTO'95, Lecture Notes in Computer Science, vol. 963, ed. D. Coppersmith. Springer-Verlag, Berlin, 262–273.Google Scholar
  4. [4]
    Meier, W. and O. Staffelbach (1992). “Correlation properties of combiners with memory in stream ciphers.” Journal of Cryptology, 5, 67–86.zbMATHMathSciNetGoogle Scholar
  5. [5]
    Rueppel, R.A. (1986). Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin.zbMATHGoogle Scholar
  6. [6]
    Rueppel, R.A. (1986). “Correlation immunity and the summation generator.” Advances in Cryptology—CRYPTO'85, Lecture Notes in Computer Science, vol. 218, ed. H.C. Williams. Springer-Verlag, Berlin, 260–272.Google Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Caroline Fontaine

There are no affiliations available