Golomb의 공리를 이용한 Shrinking Generator의 분석

Cryptanalysis of Shrinking Generator by Golomb's Randomness Postillate

The shrinking generator is simple and stateable, and known that has good security properties. The bits of one output( $R_1$) are used to determine whether the corresponding bits of the second output will be used as part of the overall keystream. Two LFSRs consisting the generator generate pseudorandom sequences satisfying Golomb's postulates. We used this property to analyze the stream of LFSR $R_1$ of the generator.