Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

3 relations
Correlation attackCryptographyFeedback with Carry Shift Registers

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Strumok keystream generator
This work presents the main results of development of a new keystream generator, which is named “Strumok”, and offered as a… 
  • figure 1
  • figure 2
  • table I
2009
2009
NLM-128, an Improved LM-Type Summation Generator with 2-Bit memories
The NLM family of keystream generator is based on the LM-type summation generator. A nonlinear feedback shift register is added… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Highly Cited
2005
Highly Cited
2005
Interferometric observations of rapidly rotating stars
Optical interferometry provides us with a unique opportunity to improve our understanding of stellar structure and evolution… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
F-FCSR: Design of a New Class of Stream Ciphers
In this paper we present a new class of stream ciphers based on a very simple mechanism. The heart of our method is a Feedback… 
Highly Cited
2005
Highly Cited
2005
Design and properties of a new pseudorandom generator based on a filtered FCSR automaton
Feedback with carry shift registers (FCSR) was introduced by Goresky and Klapper in 1993. It is similar to the classical linear… 
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Highly Cited
2004
Highly Cited
2004
Algebraic Attacks on Summation Generators
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n… 
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
2000
2000
On an improved summation generator with 2-bit memory
Abstract The summation generator is a real adder generator with a maximum period, near-maximum linear complexity and maximum… 
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
2000
2000
Fast Correlation Attacks on the Summation Generator
Abstract. The linear sequential circuit approximation method for combiners with memory is used to find mutually correlated linear… 
  • table 1
  • table 2
  • table 3
  • table 4
  • table 6
Highly Cited
1993
Highly Cited
1993
2-Adic Shift Registers
Pseudorandom sequences, with a variety of statistical properties (such as high linear span, low autocorrelation and pairwise… 
  • figure 1
Highly Cited
1985
Highly Cited
1985
Correlation Immunity and the Summation Generator
It is known that for a memoryless mapping from GF(2)N into GF(2) the nonlinear order of the mapping and its correlation-immunity… 
  • figure 1
  • figure 2
  • figure 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE