Reeds–Sloane algorithm: Difference between revisions

Revision as of 17:19, 21 December 2009

Revision as of 21:14, 22 December 2009

Line 1:

{{Orphan|date=December 2009}}

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|integers mod ''n'']].

== External links ==

* [http://mathworld.wolfram.com/Reed-SloaneAlgorithm.html Reed–Sloane Algorithm] on [[MathWorld]]

== References ==

Line 20 ⟶ 17:

}}

== External links ==

[[Category:Cryptanalytic algorithms]]

* [http://mathworld.wolfram.com/Reed-SloaneAlgorithm.html Reed–Sloane Algorithm] on [[MathWorld]]

[[Category:Cryptanalytic algorithms]]

{{crypto-stub}}