Abstract
The Berlekamp algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. We present an algorithm which generalizes Berlekamp’s to the case when the elements of the sequence are integers modulo m, where m is an arbitrary (but known) integer. Details will be published elsewhere.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Reeds, J.A., Sloane, N.J.A. (1984). Shift-Register Synthesis (Modulo m). In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_20
Download citation
DOI: https://doi.org/10.1007/978-1-4684-4730-9_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-4732-3
Online ISBN: 978-1-4684-4730-9
eBook Packages: Springer Book Archive