In cryptography, the shrinking generator is a form of pseudorandom number generator intended to be used in a stream cipher. It was published in Crypto 1993 by Don Coppersmith, Hugo Krawczyk, and Yishay Mansour.
The shrinking generator uses two linear feedback shift registers. One, called the A sequence, generates output bits, while the other, called the S sequence, controls their output. Both A and S are clocked; if the S bit is 1, then the A bit is output; if the S bit is 0, the A bit is discarded, nothing is output, and we clock the registers again. This has the disadvantage that the generator's output rate varies irregularly, and in a way that hints at the state of S; this problem can be overcome by buffering the output.
Despite this simplicity, the shrinking generator has remained remarkably resistant to cryptanalysis: there are currently no known attacks better than exhaustive search when the feedback polynomials are secret.
An interesting variant is the self-shrinking generator.
Read more about Shrinking Generator: An Implementation of A Shrinking Generator in Python
Famous quotes containing the words shrinking and/or generator:
“The Anglo-Saxon hive have extirpated Paganism from the greater part of the North American continent; but with it they have likewise extirpated the greater portion of the Red race. Civilization is gradually sweeping from the earth the lingering vestiges of Paganism, and at the same time the shrinking forms of its unhappy worshippers.”
—Herman Melville (1819–1891)
“He admired the terrible recreative power of his memory. It was only with the weakening of this generator whose fecundity diminishes with age that he could hope for his torture to be appeased. But it appeared that the power to make him suffer of one of Odette’s statements seemed exhausted, then one of these statements on which Swann’s spirit had until then not dwelled, an almost new word relayed the others and struck him with new vigor.”
—Marcel Proust (1871–1922)