Summation generator

The summation generator, created in 1985, by Rainer Rueppel, was a cryptography and security front-runner in the late 1980s. It operates by taking… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
The NLM family of keystream generator is based on the LM-type summation generator. A nonlinear feedback shift register is added… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2007
2007
In 1986, Rueppel has pioneered the notion of summation generator and shown that the proposed summation generator obtained maximum… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2005
2005
The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
Feedback with carry shift registers (FCSR) was introduced by Goresky and Klapper in 1993. It is similar to the classical linear… (More)
  • figure 2
  • figure 3
Is this relevant?
2003
2003
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n… (More)
Is this relevant?
2003
2003
J. Dj. Golić applied linear sequential circuit approximation (LSCA) method to analyze the summation generator with an arbitrary… (More)
Is this relevant?
2002
2002
The conventional summation generator (SG) has been broken in the past using a number of di/erent methods. Recently, a modi0ed SG… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
The summation generator is a real adder generator with a maximum period, near-maximum linear complexity and maximum order of… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
The linear sequential circuit approximation method for combiners with memory is used to find mutually correlated linear… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 6
Is this relevant?
1996
1996
It is shown that an arbitrary binary keystream generator with M bits of memory can be linearly modeled as a nonautonomous linear… (More)
  • figure 1
Is this relevant?