Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Recently proposed algebraic attack has been shown to be very effective on several stream ciphers. In this paper, we have… 
2009
2009
The NLM family of keystream generator is based on the LM-type summation generator. A nonlinear feedback shift register is added… 
2007
2007
In 1986, Rueppel has pioneered the notion of summation generator and shown that the proposed summation generator obtained maximum… 
2006
2006
A highly reliable synchronous stream cipher system with absolute synchronization is proposed. The proposed system includes an… 
2005
2005
In this paper we analyze the E₀ cipher, which is the encryption system used in the Bluetooth specification. We suggest a uniform… 
2005
2005
  • Ma Wei
  • 2005
  • Corpus ID: 124501350
In this paper, the divide and conquer attack, Chepyzhov's fast correlation attack and Algebraic attack are applied on the… 
2004
2004
Feedback with Carry Shift Registers (FCSR) were introduced by M. Goresky and A. Klapper in 1993. They are very similar to… 
2003
2003
J. Dj. Golic applied linear sequential circuit approximation (LSCA) method to analyze the summation generator with an arbitrary… 
1996
1996
  • J. Golic
  • 1996
  • Corpus ID: 6720556
It is shown that an arbitrary binary keystream generator with M bits of memory can be linearly modeled as a non-autonomous linear… 
1994
1994
Pseudorandom sequences with a variety of statistical properties are important in many-areas of communications and computing…