Admin: Created page with "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..."

2019-07-21T04:04:11Z

Created page with "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..."

New page

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 2<sup>19</sup> 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 (mathematics)|function]]. The objective in the modification was to make the summation generator immune to [[correlation attack]].

An attack against the improved summation generator was reported by Mex-Perera and Shepherd in 2002 by exploiting linear relations. Besides, in June 2005 an [[algebra]]ic attack was developed. Using this attack a PC can calculate the initial state of the summation generator within 3 minutes even with 256 bit LFSRs.

==Source==

[http://wikipedia.org/ http://wikipedia.org/]

[[Category:Cryptographic algorithms]]
==See Also on BitcoinWiki==
* [[Bitvalve]]
* [[Cloverdex]]
* [[MegaChange.is]]
* [[Finafex]]
* [[EUCX]]

Summation generator - Revision history

Admin: Created page with "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..."