Maximal Periods of x + c in Fq

Authors:
Alberto Peinado Domínguez;Fausto Montoya Vitini;Jaime Muñoz Masqué;A. J. Yuste
Affiliations:
-;-;-;-
Venue:
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2001

Citing 6
Cited 0

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
Finite field for scientists and engineers

Finite field for scientists and engineers
Algorithmic number theory

Algorithmic number theory
Linear complexity of the x2 mod p orbits

Information Processing Letters
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
On the linear complexity profile of the power generator

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The orbits produced by the iterations of the mapping x 驴 x2 + c, defined over Fq, are studied. Several upper bounds for their periods are obtained, depending on the coefficient c and the number of elements q.