Reeds–Sloane algorithm: Difference between revisions

Revision as of 20:26, 2 September 2019

Revision as of 17:52, 4 September 2019

Line 1:

The '''Reeds–Sloane algorithm''', named after J. A.[[James Reeds]] and [[N. J. A.Neil Sloane]], is an extension of the [[Berlekamp–Massey algorithm]], an algorithm for finding the shortest [[linear feedback shift register]] (LFSR) for a given output [[sequence]], for use on sequences that take their values from the [[integers mod n|integers mod ''n'']].

== References ==

Line 22:

{{DEFAULTSORT:Reeds-Sloane algorithm}}

[[Category:Cryptanalytic algorithms]]

{{crypto-stub}}