Reeds–Sloane algorithm: Difference between revisions

Revision as of 01:47, 24 July 2014

Latest revision as of 20:17, 21 November 2021

(6 intermediate revisions by 5 users not shown)

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 6:

| first = J. A.

|author2=N. J. A. Sloane

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

| journal = SIAM Journal on Computing

| volume = 14

Line 12:

| pages = 505–513

| year = 1985

| url = http://www.research.attneilsloane.com/~njas/doc/1218shiftMe111.pdf

| doi = 10.1137/0214038

| citeseerx = 10.1.1.48.4652

}}

== External links ==

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

{{DEFAULTSORT:Reeds-Sloane algorithm}}

[[Category:Cryptanalytic algorithms]]

{{crypto-stub}}