Abstract
The conventional summation generator (SG) has been broken in the past using a number of different methods. Recently, a modified SG was proposed by Lee and Moon to increase the resistance of such generators against these attacks. However, this paper shows that even the modified generator is still vulnerable to correlation attacks.Version
No full-text available in the repositoryCitation
Mex-Pereira, J.C. and Shepherd, S.J. (2002). Cryptanalysis of a summation generator with 2 bits of memory. Signal Processing. Vol. 82, No. 12, pp. 2025-2028.Link to Version of Record
https://doi.org/10.1016/S0165-1684(02)00356-0Type
Articleae974a485f413a2113503eed53cd6c53
https://doi.org/10.1016/S0165-1684(02)00356-0