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

Citations

1813	The Art of Computer Programming - Knuth - 1968
900	Applied Cryptography - Schneier - 1996
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
670	An Introduction to the Theory of Numbers - Hardy, Wright - 1971
432	A classical introduction to modern number theory. 2nd ed - Ireland, Rosen - 1990
185	A simple unpredictable pseudo-random number generator - Blum, Shub - 1986
151	p-adic numbers, p-adic analysis, and zeta functions - Koblitz - 1984
112	Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes - Hardy, Littlewood
96	Analysis and Design of Stream Ciphers - Rueppel - 1986
61	on Artin’s conjecture - Hooley - 1967
49	Shift Register Sequences. Aegean Park - Golomb - 1982
34	A new class of random number generators - Marsaglia, Zaman - 1991
27	The Fast Fourier Transform in a finite field - Pollard - 1971
24	Error Coding For Arithmetic Processors - Rao - 1974
17	Arithmetic Cross-Correlations of FCSR Sequences - Goresky, Klapper - 1997
15	Correlation properties of combiners with memory in stream ciphers - Meier, Staelbach - 1992
14	Continued fractions and Berlekamp’s algorithm - Welch - 1979
13	2-Adic Shift Registers, Fast Software Encryption - Klapper, Goresky - 1994
13	Continued fractions and linear recurrences - Mills - 1975
12	Arithmetic codes with large distance - Mandelbaum - 1967
11	Stream Ciphers and Number Theory - Cusick, Ding, et al. - 1998
11	Cryptanalysis based on 2-adic rational approximation - Klapper, Goresky - 1995
10	Linear size finite automata for the set of all subwords of a word: an outline of results - Blumer, Blumer, et al. - 1983
10	Feedback with Carry Shift Registers over Finite Fields - Klapper - 1994
9	Feedback registers based on ramified extensions of the 2-adic numbers (extended abstract - Goresky, Klapper - 1994
9	Schnelle Multiplikation grosser - Schönhage, Strassen - 1971
8	Disquisitiones Arithmeticae, 1801; reprinted in English translation by Yale Univ - Gauss - 1966
7	Large period nearly de Bruijn FCSR sequences - Klapper, Goresky - 1995
7	Method of, and Apparatus for, Transforming a Digital Data Sequence into an Encoded - Massey, Rueppel - 1989
6	On the continued fraction and Berlekamp’s algorithm - Cheng - 1984
6	Mapping integers and Hensel codes onto Farey fractions - Kornerup, Gregory - 1983
6	A class of balanced binary sequences with optimal autocorrelation properties - Lempel, Cohn, et al. - 1977
5	On the Quadratic Spans of De Bruijn Sequences - Chan, Games - 1990
5	The mathematics of random number generators, The Unreasonable Effectiveness of Number Theory - Marsaglia - 1992
5	personal communication - BOMBIERI
4	A new method for constructing multiple error correcting linear residue codes - Barrows - 1966
4	Error-Correcting Codes, 2nd edn - Peterson, Weldon - 1972
4	de Weger: Approximation lattices of padic numbers - M - 1986
3	Efficient prediction of Marsaglia-Zaman random number generators - Bach - 1993
3	Continued Fractions and Berlekamp-Massey Algorithm - Dai - 1990
3	Boekee, The shortest feedback shift register that can generate a given sequence - Jansen, E - 1990
3	On a geometrical representation of p-adic numbers - MAHLER - 1940
3	An approach to an arithmetic analog of Berlekamp’s algorithm - Mandelbaum - 1984
2	Ebbinghaus et al, Numbers. Graduate Texts - D - 1990
2	On the significance of the directed acyclic word graph in cryptology - Jansen, Boekee - 1990
1	Information theory of shift registers - Jansen - 1989