Exponential sums and linear complexity of nonlinear pseudorandom number generators with polynomials of small p-weight degree

zbMATH Open1249.11081MaRDI QIDQ3083191FDOQ3083191

Authors: Álvar Ibeas, Arne Winterhof 

Publication date: 18 March 2011

Recommendations

• Generalized explicit inversive generators of small \(p\)-weight degree
• Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• scientific article; zbMATH DE number 1504654
• Exponential sums with Dickson polynomials

zbMATH Keywords

discrepancyexponential sumsfinite fieldspseudorandom numbers

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Cited In (4)

• Generalized explicit inversive generators of small \(p\)-weight degree
• On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials
• Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions
• The sum of \(D\) small-bias generators fools polynomials of degree \(D\)

This page was built for publication: Exponential sums and linear complexity of nonlinear pseudorandom number generators with polynomials of small \(p\)-weight degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083191)