Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
type: Item
instance of: scholarly article
title: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
zbMATH Open document ID: 1242.94023
published in: Information Processing Letters
publication date: 2012-07-18T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11K45
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6058201
zbMATH Keywords: cryptography
zbMATH Keywords: Fermat quotients
zbMATH Keywords: polynomial quotients
zbMATH Keywords: finite fields
zbMATH Keywords: pseudorandom sequences
zbMATH Keywords: linear complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.11.017
OpenAlex ID: W2089294177
cites work: Structure of Pseudorandom Numbers Derived from Fermat Quotients
cites work: Additive character sums of polynomial quotients
cites work: On the 𝑝-divisibility of Fermat quotients
cites work: Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
cites work: Q3480124
cites work: Multiplicative character sums of Fermat quotients and pseudorandom sequences
cites work: A remark on Artin's conjecture
cites work: ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
cites work: Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
cites work: Q3999066
cites work: Q3216750
cites work: On primes in arithmetic progression having a prescribed primitive root
cites work: Pseudorandomness and Dynamics of Fermat Quotients
cites work: CHARACTER SUMS WITH FERMAT QUOTIENTS
cites work: BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
cites work: On the value set of Fermat quotients
cites work: Fermat quotients: exponential sums, value set and primitive roots
DOI: 10.1016/J.IPL.2011.11.017
Recommended article: Linear complexity of a class of pseudorandom sequences over a general finite field
Recommended article: Linear complexity of pseudorandom sequences based on summation of polynomial quotients
Recommended article: On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
Recommended article: On the linear complexity of binary threshold sequences derived from Fermat quotients
Recommended article: On k-error linear complexity of some explicit nonlinear pseudorandom sequences
Recommended article: Pseudorandomness and Dynamics of Fermat Quotients
Recommended article: Q4832278
Recommended article: On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
Recommended article: On the linear complexity and lattice test of nonlinear pseudorandom number generators
author: Xiaoni Du
author: Andrew Klapper
author: Zhixiong Chen
description: scientific article; zbMATH DE number 6058201