Reeds–Sloane algorithm: Difference between revisions

Revision as of 10:11, 20 February 2009

Revision as of 05:41, 5 October 2009

Line 1:

{{Context|date=October 2009}}

{{cleanup-context}}

The '''Reeds-Sloane algorithm''' 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]].

Line 20:

}}

[[Category:Cryptanalytic algorithms]]

{{crypto-stub}}

{{crypto-stub}}

[[Category:Cryptanalytic algorithms]]