Skip to main content
Article thumbnail
Location of Repository

Cryptanalysis of a summation generator with 2 bits of memory.

By Simon J. Shepherd and Jorge C. Mex-Pereira

Abstract

NoThe 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

Topics: Cryptanalysis, Correlation attack, Keystream generator
Year: 2002
DOI identifier: 10.1016/S0165-1684(02)00356-0
OAI identifier: oai:bradscholars.brad.ac.uk:10454/3744
Provided by: Bradford Scholars
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10454/37... (external link)
  • http://dx.doi.org/10.1016/S016... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.