Summation generator

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 the output of two LFSR's through an adder with carry. The operation's strength is that it is nonlinear. However, through the early 1990s various attacks against the summation generator eventually led to its fall to a correlation attack. In 1995 Klapper and Goresky were able to determine the summation generator's sequence in only 219 bits.

An improved summation generator with 2-bit memory was then proposed by cryptographers Lee and Moon. In the new generator scheme an extra bit of memory is added to the nonlinear combining function. The objective in the modification was to make the summation generator immune to correlation attack.

However, in June 2005 an algebraic attack against the improved summation generator was developed. Using this attack a PC can calculate the initial state of the summation generator within 3 minutes even with 256 bit LFSR's

References

* R. A. Rueppel, "Correlation immunity and the Summation Generator," Advances in Cryptography-EUROCRYPT '85 proceedings, Berlin: Springer-Verlag, 1986, pp. 260-272.

* W.Meier and O. Staffelbach, "Correlation properties of Combiners with Memory in Stream Ciphers," Advances in Cryptography-EUROCRYPT '90 proceedings, Berlin: Springer-Verlag, 1991, pp. 204-213.

* Bruce Schneir, "Applied Cryptography," pg. 364, Summation Generator

* "An algebraic attack on the improved summation generator with 2-bit memory" Information Processing Letters, Volume 93 , Issue 1, (January 2005) Pages: 43 - 46 ISSN:0020-0190

External links

* [http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/C85/260.PDF Correlation Immunity and the Summation Generator]

* [http://ciphersbyritter.com/RES/COMBCORR.HTM The story of combiner correlation]

* [http://citeseer.ist.psu.edu/cache/papers/cs/31398/http:zSzzSzeprint.iacr.orgzSz2003zSz229.pdf/lee03algebraic.pdf Algebraic Attacks on Summation Generators]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Dysmetria — (Greek: difficult to measure ) refers to a lack of coordination of movement typified by the undershoot and/or overshoot of intended position with the hand, arm, leg, or eye. It is sometimes described as an inability to judge distance or… …   Wikipedia

  • Trigonometry in Galois fields — In mathematics, the theory of quadratic extensions of finite fields supports analogies with trigonometry.The main motivation to deal with a finite field trigonometry is the power of the discrete transforms, which play an important role in… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • Wikipedia:Citation templates — WP:CT redirects here. For WikiProject Connecticut, see WP:CONN. This page is a how to guide detailing a practice or process on the English Wikipedia. Shortcuts: WP:CITET …   Wikipedia

  • Root of unity — The 5th roots of unity in the complex plane In mathematics, a root of unity, or de Moivre number, is any complex number that equals 1 when raised to some integer power n. Roots of unity are used in many branches of mathematics, and are especially …   Wikipedia

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Automatic calculation of particle interaction or decay — The automatic calculation of particle interaction or decay is part of the computational particle physics branch. It refers to computing tools that help calculating the complex particle interactions as studied in high energy physics, astroparticle …   Wikipedia

  • Photon — This article is about the elementary particle of light. For other uses, see Photon (disambiguation). Photon Photons emitted in a coherent beam from a laser Composition Elementary particle …   Wikipedia

  • Philo Farnsworth — Infobox Person name = Philo Taylor Farnsworth image size = caption = 1983 United States postage stamp honoring Farnsworth birth name = birth date = birth date|1906|8|19 birth place = Beaver, Utah, USA death date = death date and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”