Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,895,812 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Correlation attack
Cryptography
Feedback with Carry Shift Registers
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
NLM-128, an Improved LM-Type Summation Generator with 2-Bit memories
Hoonjae Lee
,
SangMin Sung
,
HyeongRag Kim
Fourth International Conference on Computer…
2009
Corpus ID: 15843551
The NLM family of keystream generator is based on the LM-type summation generator. A nonlinear feedback shift register is added…
Expand
Highly Cited
2005
Highly Cited
2005
Design and properties of a new pseudorandom generator based on a filtered FCSR automaton
F. Arnault
,
T. Berger
IEEE transactions on computers
2005
Corpus ID: 17454985
Feedback with carry shift registers (FCSR) was introduced by Goresky and Klapper in 1993. It is similar to the classical linear…
Expand
Highly Cited
2005
Highly Cited
2005
F-FCSR: Design of a New Class of Stream Ciphers
F. Arnault
,
T. Berger
Fast Software Encryption Workshop
2005
Corpus ID: 639896
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
Highly Cited
2005
Highly Cited
2005
Interferometric observations of rapidly rotating stars
G. Belle
2005
Corpus ID: 119273474
Optical interferometry provides us with a unique opportunity to improve our understanding of stellar structure and evolution…
Expand
2005
2005
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences
Z. Tasheva
,
B. Bedzhev
,
B. Stoyanov
IACR Cryptology ePrint Archive
2005
Corpus ID: 14783391
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
Highly Cited
2004
Highly Cited
2004
Algebraic Attacks on Summation Generators
Dong Hoon Lee
,
Jaeheon Kim
,
Jin Hong
,
Jae-Woo Han
,
Dukjae Moon
Fast Software Encryption Workshop
2004
Corpus ID: 18454865
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n…
Expand
2004
2004
Design of new pseudorandom generators based on a filtered FCSR automaton
F. Arnault
,
T. Berger
2004
Corpus ID: 16451338
Feedback with Carry Shift Registers (FCSR) were introduced by M. Goresky and A. Klapper in 1993. They are very similar to…
Expand
Highly Cited
1995
Highly Cited
1995
Cryptanalysis Based on 2-Adic Rational Approximation
A. Klapper
,
M. Goresky
Annual International Cryptology Conference
1995
Corpus ID: 10777247
This paper presents a new algorithm for cryptanalytically attacking stream ciphers. There is an associated measure of security…
Expand
Highly Cited
1993
Highly Cited
1993
2-Adic Shift Registers
A. Klapper
,
M. Goresky
Fast Software Encryption Workshop
1993
Corpus ID: 11938684
Pseudorandom sequences, with a variety of statistical properties (such as high linear span, low autocorrelation and pairwise…
Expand
Highly Cited
1985
Highly Cited
1985
Correlation Immunity and the Summation Generator
R. A. Rueppel
Annual International Cryptology Conference
1985
Corpus ID: 24085779
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE