Cryptanalysis of a summation generator with 2 bits of memory.

Description

No / 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.

Links & Downloads

1. 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.
2. http://hdl.handle.net/10454/3744
3. https://doi.org/10.1016/S0165-1684(02)00356-0

Tags

Cryptanalysis

Correlation attack

Keystream generator

Additional Fields

Identifer	oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3744
Date	January 2002
Creators	Shepherd, Simon J., Mex-Pereira, Jorge C.
Source Sets	Bradford Scholars
Language	English
Detected Language	English
Type	Article, No full-text in the repository