On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials

DOI10.1007/s10623-005-3190-xzbMath1172.11305OpenAlexW2054944103MaRDI QIDQ2491293

Arne Winterhof, Hassan Y. Aly

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-3190-x

zbMATH Keywords

linear complexity profilecryptographyDickson polynomialsnonlinear congruential generator

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (1)

On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions

Cites Work

• Exponential sums with Dickson polynomials
• On the linear complexity profile of the power generator
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• On the linear complexity of the power generator

This page was built for publication: On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials