Abstract
We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.
| Original language | English |
|---|---|
| Pages (from-to) | 1005-1011 |
| Number of pages | 7 |
| Journal | Mathematics of Computation |
| Volume | 73 |
| Issue number | 246 |
| DOIs | |
| Publication status | Published - Apr 2004 |
Bibliographical note
Copyright 2004 American Mathematical Society. First published in Mathematics of computation, vol. 73, no. 246, 2004, published by the American Mathematical Society. The original article can be found at http://dx.doi.org/10.1090/S0025-5718-03-01563-1Fingerprint
Dive into the research topics of 'On the multidimensional distribution of the subset sum generator of pseudorandom numbers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver