ArticleslgStudy

biology

Self-shrinking generator

Self-shrinking generator is a biology topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Self-shrinking generator rather than just read about it. In short: A self-shrinking generator is a pseudorandom generator that is based on the shrinking generator concept. Variants of the self-shrinking generator based on a linear-feedback shift register (LFSR) are studied for use in cryptography.

Key takeaways

  • Self-shrinking generator belongs to biology; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Self-shrinking generator to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Self-shrinking generator from memory before moving on to harder problems.

Reference excerpt

A self-shrinking generator is a pseudorandom generator that is based on the shrinking generator concept. Variants of the self-shrinking generator based on a linear-feedback shift register (LFSR) are studied for use in cryptography.

Algorithm In difference to the shrinking generator, which uses a second feedback shift register to control the output of the first, the self-shrinking generator uses alternating output bits of a single register to control its final output. The procedure for clocking this kind of generator is as follows:

Clock the LFSR twice to obtain a pair of bits as LFSR output. If the pair is 10 output a zero. If the pair is 11 output a one. Otherwise, output nothing. Return to step one.

Example This example will use the connection polynomial x8 + x4 + x3 + x2 + 1, and an initial register fill of 1 0 1 1 0 1 1 0. Below table lists, for each iteration of the LFSR, its intermediate output before self-shrinking, as well as the final generator output. The tap positions defined by the connection polynomial are marked with blue headings. The state of the zeroth iteration represents the initial input.

At the end of four iterations, the following sequence of intermediate bits is produced: 0110. The first pair of bits, 01, is discarded since it does not match either 10 or 11. The second pair of bits, 10, matches the second step of the algorithm, so a zero is output. More bits are created by continuing to clock the LFSR and shrinking its output as described above.

Cryptanalysis As with the shrinking generator, the self-shrinking generator is vulnerable to timing attacks since the output rate varies depending on the state. In their paper, Meier and Steffelbach prove that a LFSR-based self-shrinking generator with a connection polynomial of length L results in an output sequence period of at least 2L/2, and a linear complexity of at least 2L/2-1. Furthermore, they show that any self-shrinking generator can be represented as a shrinking-generator. The inverse is also true: Any shrinking generator can be implemented as a self-shrinking generator, although the resultant generator may not be of maximal length. An attack presented by the authors requires about 20.7L steps, assuming a known connection polynomial. A more advanced attack, discovered by Mihaljević, is able to break a register a hundred bits in length in around 257 steps, using an output sequence of only 4.9 × 108 bits. Another attack requires 20.694L steps.

References

Further reading Handbook of Applied Cryptography

Worked examples

Example 1 — a first encounter with Self-shrinking generator

Start with the simplest possible case. Write down what Self-shrinking generator claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In biology, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Self-shrinking generator before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Self-shrinking generator ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Self-shrinking generator

In research
Self-shrinking generator appears in biology research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Self-shrinking generator in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Self-shrinking generator is common in secondary-school and first-year university syllabi. It links to neighbouring topics Cryptography, Pseudorandom number generators, so understanding it makes those chapters shorter.
In everyday life
Look for Self-shrinking generator outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Self-shrinking generator” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Self-shrinking generator in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Self-shrinking generator means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Self-shrinking generator out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Self-shrinking generator in simple terms?

A self-shrinking generator is a pseudorandom generator that is based on the shrinking generator concept. Variants of the self-shrinking generator based on a linear-feedback shift register (LFSR) are studied for use in cryptography.

Why does Self-shrinking generator matter?

Because it connects several biology ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Self-shrinking generator?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Self-shrinking generator.

Tags

  • Cryptography
  • Pseudorandom number generators

Keep exploring