Skip to search formSkip to main content
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… Expand
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… Expand
  • figure 1
  • figure 2
  • table I
Is this relevant?
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… Expand
Is this relevant?
2005
2005
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences
The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2004
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… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Cryptanalysis Based on 2-Adic Rational Approximation
This paper presents a new algorithm for cryptanalytically attacking stream ciphers. There is an associated measure of security… Expand
  • figure 1
Is this relevant?
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… Expand
  • figure 1
Is this relevant?
1992
1992
Cryptanalysis of Summation Generator
In this paper two known plaintext attacks on the summation generator will be described. The first attack is a new method of… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
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