Using irreducible polynomials for random number generation

DOI10.33039/AMI.2022.12.012MaRDI QIDQ5886205zbMATH OpenOpenAlexFDO

Authors Tamás Herendi

Publication date 30 March 2023

Published in Annales Mathematicae et Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33039/ami.2022.12.012

zbMATH Keywords

finite fieldsirreducible polynomialsrandom number generation

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08)

Recommendations

• scientific article; zbMATH DE number 2051228
• The revised recursive reduction for efficiently generating random numbers
• On the Use of Reducible Polynomials as Random Number Generators
• Explicit Inversive Congruential Pseudorandom Numbers with Power of Two Modulus
• Efficient, perfect polynomial random number generators

Cited in

(1)

• Reducing Randomness via Irrational Numbers

This page was built for publication: Using irreducible polynomials for random number generation

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