Reference work entry
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.
- 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
- 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
- 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
© International Federation for Information Processing 2005