Reeds–Sloane algorithm: Difference between revisions

Revision as of 05:41, 16 October 2008

Latest revision as of 20:17, 21 November 2021

(32 intermediate revisions by 15 users not shown)

Line 1:

The '''Reed-SloaneReeds–Sloane algorithm''', named after [[James Reeds]] and [[Neil Sloane]], is an extension of the [[Berlekamp-MasseyBerlekamp–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'']].

{{cleanup-context}}

The '''Reed-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]].

== References ==

* {{cite journal

| last = Reeds

| first = J. A.

|author2=N. J. A. Sloane

| title = Shift-Register Synthesis (Modulo ''m'')

| journal = SIAM Journal on Computing

| volume = 14

| issue = 3

| pages = 505–513

| year = 1985

| url = http://neilsloane.com/doc/Me111.pdf

| doi = 10.1137/0214038

| citeseerx = 10.1.1.48.4652

}}

== External links ==

{{crypto-stub}}

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

{{DEFAULTSORT:Reeds-Sloane algorithm}}

[[Category:Cryptanalytic algorithms]]

{{crypto-stub}}