On the linear complexity of bounded integer sequences over different moduli

DOI10.1016/J.IPL.2005.08.004zbMath1191.68287OpenAlexW2052086485MaRDI QIDQ1044731

Igor E. Shparlinski, Arne Winterhof

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.004

zbMATH Keywords

sequencescryptographylinear complexitypseudorandom number generatorsresidue ringsSidelnikov sequences

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (2)

Addendum to Sidel'nikov sequences over nonprime fields ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences

Cites Work

• Unnamed Item
• Unnamed Item
• The vulnerability of geometric sequences based on fields of odd characteristic
• On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• On the linear complexity profile of some new explicit inversive pseudorandom numbers
• Prime divisors of sparse integers
• Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
• Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
• Certain Exponential Sums and Random Walks on Elliptic Curves

This page was built for publication: On the linear complexity of bounded integer sequences over different moduli