Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,728,809 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.
2017
2017
A parallel SAT solving algorithm based on improved handling of conflict clauses
O. Zaikin
2017
Corpus ID: 196035007
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
2007
2007
Hierarchical Dawson's Summation Generator
Meng-Hui Lim
,
B. Goi
,
Sanggon Lee
,
Hoonjae Lee
International Conference on Communications and…
2007
Corpus ID: 15044802
In 1986, Rueppel has pioneered the notion of summation generator and shown that the proposed summation generator obtained maximum…
Expand
2006
2006
Highly Reliable Synchronous Stream Cipher System for Link Encryption
Hoon-Jae Lee
Communication Systems and Applications
2006
Corpus ID: 46458088
A highly reliable synchronous stream cipher system with absolute synchronization is proposed. The proposed system includes an…
Expand
2005
2005
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences
Zhaneta 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
2005
2005
Cryptanlysis of the Improved Summation Generator
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…
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
1996
1996
Linear Models for Keystream Generators
J. Golic
IEEE Trans. Computers
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…
Expand
1994
1994
Feedback with carry shift registers: 2-adic models and summation combiners
A. Klapper
,
M. Goresky
Proceedings of IEEE International Symposium on…
1994
Corpus ID: 117987766
Pseudorandom sequences with a variety of statistical properties are important in many-areas of communications and computing…
Expand
1992
1992
Cryptanalysis of Summation Generator
E. Dawson
AUSCRYPT
1992
Corpus ID: 150356
In this paper two known plaintext attacks on the summation generator will be described. The first attack is a new method of…
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