On the linear complexity of bounded integer sequences over different moduli
type: Item
instance of: scholarly article
title: On the linear complexity of bounded integer sequences over different moduli
zbMATH Open document ID: 1191.68287
author: Igor E. Shparlinski
author: Arne Winterhof
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5650151
zbMATH Keywords: linear complexity
zbMATH Keywords: sequences
zbMATH Keywords: residue rings
zbMATH Keywords: pseudorandom number generators
zbMATH Keywords: Sidelnikov sequences
zbMATH Keywords: cryptography
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.08.004
OpenAlex ID: W2052086485
cites work: On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
cites work: Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
cites work: Linear Complexity Over&lt;tex&gt;$F_p$&lt;/tex&gt;of Sidel'nikov Sequences
cites work: Q4421634
cites work: The vulnerability of geometric sequences based on fields of odd characteristic
cites work: On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
cites work: Certain Exponential Sums and Random Walks on Elliptic Curves
cites work: On the linear complexity profile of some new explicit inversive pseudorandom numbers
cites work: Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
cites work: Prime divisors of sparse integers
cites work: Q3154878
DOI: 10.1016/J.IPL.2005.08.004
description: scientific article; zbMATH DE number 5650151