(Enter summary)
Abstract: Pseudo-random numbers with long periods and
good statistical properties are often required for
applications in computational
nance,
numerical integration, physics, simulation, etc.
We consider the requirements for good uniform
random number generators, and describe a class
of generators whose period is a Mersenne prime
or a small multiple of a Mersenne prime. These
generators are based on primitive or \almost
primitive" trinomials, that is trinomials having
a large primitive factor. They enable ... (Update)
Cited by: More
A Primitive Trinomial of Degree 6972593 - Brent, Larvala, Zimmermann
(Correct)
Almost Irreducible and Almost Primitive Trinomials - Brent, Zimmermann (2003)
(Correct)
Algorithms for Finding Almost Irreducible and Almost.. - Brent, Zimmermann (2003)
(Correct)
Similar documents (at the sentence level):
13.4%: Uniform Random Number Generators and Primitive Trinomials - Brent (2001)
(Correct)
Active bibliography (related documents): More All
2.5: Random Number Generators with Period Divisible by a Mersenne.. - Brent, Zimmermann (2003)
(Correct)
1.3: A Fast Algorithm For Testing Irreducibility Of Trinomials.. - Brent, Larvala, Zimmermann (2000)
(Correct)
0.9: On the Periods of Generalized Fibonacci Recurrences - Brent (1992)
(Correct)
Similar documents based on text: More All
0.3: A Fast Algorithm For Testing Reducibility Of Trinomials .. - Brent, Larvala.. (2003)
(Correct)
0.2: Parallel Linear Congruential Generators With Prime Moduli - Mascagni (1997)
(Correct)
Related documents from co-citation: More All
9: whose degree is a Mersenne exponent (context) - Kurita, Matsumoto et al. - 1991
5: New primitive trinomials of Mersenneexponent degrees for random-number generatio.. (context) - Heringa, Blote et al. - 1992
5: A fast algorithm for testing reducibility of trinomials mod 2 and some new primi..
- Brent, Larvala et al. - 2003
BibTeX entry: (Update)
R. P. Brent and P. Zimmermann, Random number generators with period divisible by a Mersenne prime, in Computational Science and its Applications { ICCSA 2003. http://citeseer.ist.psu.edu/article/brent03random.html More
@misc{ brent03random,
author = "R. Brent and P. Zimmermann",
title = "Random number generators with period divisible by a Mersenne prime",
text = "R. P. Brent and P. Zimmermann, Random number generators with period divisible
by a Mersenne prime, in Computational Science and its Applications { ICCSA
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/brent03random.html" }
Citations (may not include all citations):
1065
Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1997
216
Volume 2: Seminumerical algorithms (context) - Knuth, of et al. - 1998
170
Shift register sequences (context) - Golomb - 1967
145
Introduction to Finite Fields and their Applications (context) - Lidl, Niederreiter - 1994
57
A current view of random number generators (context) - Marsaglia - 1985
49
Random number generators on vector supercomputers and other .. (context) - Anderson - 1990
43
A new class of random number generators (context) - Marsaglia, Zaman - 1991
38
A review of pseudorandom number generators (context) - James - 1990
35
Random numbers generated by linear recurrence modulo two (context) - Tausworthe - 1965
30
Random numbers fall mainly in the planes (context) - Marsaglia - 1968
24
Matrices and the structure of random number sequences (context) - Marsaglia, Tsay - 1985
23
whose degree is a Mersenne exponent (context) - Kumada, Leeb et al. - 2002
23
whose degree is a Mersenne exponent (context) - Kurita, Matsumoto et al. - 1991
21
Primitive trinomials whose degree is a Mersenne exponent (context) - Zierler - 1969
14
The shrinking generator (context) - Coppersmith, Krawczyk et al. - 1994
14
New primitive trinomials of Mersenne-exponent degrees for ra.. (context) - Heringa, Bl et al. - 1992
12
Analysis of additive random number generators (context) - Reiser - 1977
9
Physical tests for random numbers in simulations
- Vattulainen, Ala-Nissila et al. - 1994
8
Primitive trinomials of high degree (context) - Rodemich, Rumsey - 1968
8
Primitive binary polynomials (context) - Stahnke - 1973
7
Random number generation and simulation on vector and parall..
- Brent - 1998
7
Factorization of polynomials over nite elds (context) - Swan - 1962
6
Primitive polynomials (context) - Watson - 1962
6
389-401 (context) - Brent, periods et al. - 1994
5
Monte Carlo simulations: Hidden errors from \good (context) - Ferrenberg, Landau et al. - 1992
5
Ecient and portable combined Tausworthe random number genera.. (context) - Tezuka - 1991
4
A portable high-quality random number generator for lattice .. (context) - uscher - 1994
3
A fast algorithm for testing irreducibility of trinomials mo..
- Brent, Larvala et al. - 2003
3
Simulation of a directed random-walk model: the eect of pse.. (context) - Shchur, Heringa et al. - 1997
3
Maximum-length sequences (context) - Compagner, Hoogland - 1987
2
The RANLUX generator: resonances in a random walk test (context) - Shchur, Butera - 1998
1
Available from http://www (context) - Brent, uniform et al. - 2002
http://www.mersenne.org/
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pub/pub211.html):
Random Number Generators with Period Divisible by a Mersenne.. - Brent, Zimmermann (2003)
(Correct)
Random Number Generators with Period Divisible by a Mersenne.. - Brent, Zimmermann (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC