Project sponsored by the Natural Sciences and Engineering Researh Council under Operating Grant OGP0121648 and the National Security Agency under Grant Number MDA904-91-H-0012. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon
Chapter PDF
References
J. T. Barrows, Jr., A new method for constructing multiple error correcting linear residue codes, Rep. R-277, Coordinated Sci. Lab., Univ. of Illinois, Urbana, 1966.
L. Blum, M. Blum, and M. Shub, A simple unpredictable pseudo-random number generator, Siam J. Comput. vol. 15, 1986 pp. 364–383.
C. F. Gauss, Disquisitiones Arithmeticae, 1801; reprinted in English translation by Yale Univ. Press, New Haven, CT. 1966.
S. GolombShift Register Sequences. Aegean Park Press, Laguna Hills CA, 1982.
D. Knuth, The Art of Computer Programming, Vol 2. Seminumerical Algorithms. Addison-Wesley, Reading MA, 1981.
D. Mandelabaum, Arithmetic codes with large distance. IEEE Trans. Info. Theory, vol. IT-13, 1967 pp. 237–242.
D. Mandelbaum, An approach to an arithmetic analog of Berlekamp's algorithm. IEEE Trans. Info. Theory, vol. IT-30, 1984 pp. 758–762.
G. Marsaglia and A. Zaman, A new class of random number generators, Annals of Applied Probability. vol. 1, 1991 pp. 462–480.
R. RueppelAnalysis and Design of Stream Ciphers. Springer Verlag, New York, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klapper, A., Goresky, M. (1994). 2-Adic shift registers. In: Anderson, R. (eds) Fast Software Encryption. FSE 1993. Lecture Notes in Computer Science, vol 809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58108-1_21
Download citation
DOI: https://doi.org/10.1007/3-540-58108-1_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58108-6
Online ISBN: 978-3-540-48456-1
eBook Packages: Springer Book Archive
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.