## Feedback shift registers, 2-adic span, and combiners with memory (1997)

### Cached

### Download Links

- [www.cs.uky.edu]
- [www.cs.engr.uky.edu]
- [www.cs.engr.uky.edu]
- [www.cs.uky.edu]
- [www.math.ias.edu]
- [www.math.ias.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Cryptology |

Citations: | 51 - 7 self |

### BibTeX

@ARTICLE{Goresky97feedbackshift,

author = {Mark Goresky},

title = {Feedback shift registers, 2-adic span, and combiners with memory},

journal = {Journal of Cryptology},

year = {1997},

volume = {10},

pages = {111--147}

}

### Years of Citing Articles

### OpenURL

### Abstract

Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR’s) are presented, including a synthesis algorithm (analogous to the Berlekamp-Massey algorithm for LFSR’s) which, for any pseudorandom sequence, constructs the smallest FCSR which will generate the sequence. These techniques are used to attack the summation cipher. This analysis gives a unified approach to the study of pseudorandom sequences, arithmetic codes, combiners with memory, and the Marsaglia-Zaman random number generator. Possible variations on the FCSR architecture are indicated at the end. Index Terms – Binary sequence, shift register, stream cipher, combiner with memory, cryptanalysis, 2-adic numbers, arithmetic code, 1/q sequence, linear span. 1