[Resource Topic] 2003/229: Algebraic Attacks on Summation Generators

Welcome to the resource topic for 2003/229

Algebraic Attacks on Summation Generators

Authors: Dong Hoon Lee, Jaeheon Kim, Jin Hong, Jae Woo Han, Dukjae Moon


We apply the algebraic attacks
on stream ciphers with memories to the summation generator.
For a summation generator that uses n LFSRs, the
algebraic equation relating the key stream bits
and LFSR output bits
can be made to be of degree less than or equal to
2^{\lceil\log_2 n \rceil}, using \lceil\log_2 n \rceil + 1
consecutive key stream bits.
This is much lower than the upper bound given by
previous general results.

ePrint: https://eprint.iacr.org/2003/229

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .