Linear recurrent sequences over a finite field and applications in cryptography

MaRDI QIDQ3095223zbMATH OpenFDO

Authors Oumar Diankha, Chérif Bachir Deme

Publication date 28 October 2011

Full work available at URL http://www.pphmj.com/abstract/5944.htm

zbMATH Keywords

cryptographymaximal periodlinear recurrent sequencessubsetsmultiplexed sequences

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Connection between classification and minimum polynomial of multiplexed sequences
• scientific article; zbMATH DE number 1484323
• scientific article; zbMATH DE number 1245626
• Statistical weakness of multiplexed sequences
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity

Cited in

(10)

• On period of multiplexed sequences
• scientific article; zbMATH DE number 3865150 (Why is no real title available?)
• scientific article; zbMATH DE number 5529045 (Why is no real title available?)
• On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
• Statistical weakness of multiplexed sequences
• Constructing new covering arrays from LFSR sequences over finite fields
• Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences
• Linear cellular automata and recurring sequences in finite fields
• Криптографически слабые функции усложнения для трехчленных линейных рекуррентных последовательностей
• scientific article; zbMATH DE number 4053512 (Why is no real title available?)

This page was built for publication: Linear recurrent sequences over a finite field and applications in cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095223)