(Enter summary)
Abstract: Feedback shift registers with carry operation (FCSRs) 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 (LFSRs) are presented, including a synthesis algorithm
(analogous to the Berlekamp--Massey algorithm for LFSRs) which, for any pseudorandom
sequence, constructs the smallest FCSR which will generate the sequence. (Update)
Similar documents (at the sentence level):
40.9%: Feedback Shift Registers, 2-Adic Span, and Combiners with Memory - Klapper, Goresky (1996)
(Correct)
Active bibliography (related documents): More All
0.8: Algebraic Feedback Shift Registers - Klapper, Xu (1999)
(Correct)
0.7: Research Summary - Klapper
(Correct)
0.6: Large Period Nearly deBruijn FCSR Sequences (Extended Abstract) - Klapper, Goresky
(Correct)
Similar documents based on text: More All
0.5: Feedback Registers Based on Ramified Extensions of the 2-Adic.. - Goresky, al. (1995)
(Correct)
0.4: Polynomial Pseudo-Noise Sequences Based on Algebraic.. - Mark Goresky Andrew
(Correct)
0.3: Arithmetic Cross-correlations of Feedback with Carry Shift.. - Goresky, Klapper (1997)
(Correct)
BibTeX entry: (Update)
@article{ klapper97feedback,
author = "Andrew Klapper and Mark Goresky",
title = "Feedback Shift Registers, {$2$}-Adic Span, and Combiners with Memory",
journal = "Journal of Cryptology: the journal of the International Association for Cryptologic Research",
volume = "10",
number = "2",
month = "Spring",
pages = "111--147",
year = "1997",
url = "citeseer.ist.psu.edu/article/klapper97feedback.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth - 1981
704
Applied Cryptography (context) - Schneier - 1996
439
An Introduction to the Theory of Numbers (context) - Hardy, Wright - 1979
352
A Course in Computational Algebraic Number Theory (context) - Cohen - 1993
170
Shift Register Sequences (context) - Golomb - 1982
167
Error-Correcting Codes (context) - Peterson, Weldon - 1972
103
A simple unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
84
Analysis and Design of Stream Ciphers (context) - Rueppel - 1986
64
A Classical Introduction to Modern Number Theory (context) - Ireland, Rosen - 1990
43
A new class of random number generators (context) - Marsaglia, Zaman - 1991
43
Schnelle Multiplikation Grosser Zahlen (context) - Schonhage, Strassen - 1971
29
Graduate Texts in Mathematics (context) - Koblitz, Numbers et al. - 1984
22
Stream Ciphers and Number Theory (context) - Ding
22
On Artin's conjecture (context) - Hooley - 1967
19
Partitio Numerorum (context) - Hardy, Littlewood et al. - 1922
14
Arithmetic cross-correlation of FCSR sequences
- Klapper, Goresky - 1996
12
Methods and Applications of Error-Free Computation (context) - Gregory, Krishnamurthy - 1984
11
Error Coding For Arithmetic Processors (context) - Rao - 1974
11
Cryptanalysis based on 2-adic rational approximation (context) - Klapper, Goresky - 1995
10
Arithmetic codes with large distance (context) - Mandelbaum - 1967
9
The fast Fourier transform in a finite field (context) - Pollard - 1971
9
Continued fractions and linear recurrences (context) - Mills - 1975
9
Feedback with carry shift registers over finite fields (context) - Klapper - 1995
7
Feedback registers based on ramified extensions of the 2-adi..
- Klapper, Goresky
7
Continued fractions and Berlekamp's algorithm (context) - Welch, Scholtz - 1979
6
Linear size finite automata for the set of all subwords of a.. (context) - Blumer, Blumer - 1983
6
transforming a digital data sequence into an encoded form (context) - Massey, Rueppel et al.
5
the continued fraction and Berlekamp's algorithm (context) - Cheng - 1984
4
Personal communication (context) - Bombieri
4
Large period nearly deBruijn FCSR sequences (context) - Klapper, Goresky
3
Approximation lattices of p-adic numbers (context) - de Weger - 1986
3
Lecture Notes in Computer Science (context) - Klapper, Goresky et al. - 1994
3
An approach to an arithmetic analog of Berlekamp's algorithm (context) - Mandelbaum - 1984
3
The shortest feedback shift register that can generate a giv.. (context) - Jansen, Boekee - 1990
2
Continued fractions and the Berlekamp--Massey algorithm (context) - Dai, Zeng - 1990
2
A class of balanced binary sequences with optimal autocorrel.. (context) - Lempel, Cohn et al. - 1977
2
a geometrical representation of p-adic numbers (context) - Mahler - 1940
2
the significance of the directed acyclic word graph in crypt.. (context) - Jansen, Boekee - 1990
2
A new method for constructing multiple error correcting line.. (context) - Barrows - 1966
2
Efficient prediction of Marsaglia--Zaman random number gener.. (context) - Bach - 1993
2
Information theory of shift registers (context) - Jansen - 1989
2
The Unreasonable Effectiveness of Number Theory (context) - Marsaglia, of et al. - 1992
2
Mapping integers and Hensel codes onto Farey fractions (context) - Krishnamurthy, Gregory - 1983
2
reprinted in English translation by Yale University Press (context) - Gauss, Arithmeticae - 1966
2
the quadratic span of de Bruijn sequences (context) - Chan, Games - 1990
1
Graduate Texts in Mathematics (context) - Ebbinghaus - 1990
Documents on the same site (http://www.math.ias.edu/~goresky/publ.html): More
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory - Klapper, Goresky (1996)
(Correct)
Local Intersection Cohomology Of Baily-Borel.. - Goresky, Harder.. (2002)
(Correct)
Toroidal And Reductive Borel-Serre Compactifications Of.. - Goresky, Tai (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC