On the multidimensional distribution of the subset sum generator of pseudorandom numbers

Alessandro Conflitti*, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
42 Downloads (Pure)

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 languageEnglish
Pages (from-to)1005-1011
Number of pages7
JournalMathematics of Computation
Volume73
Issue number246
DOIs
Publication statusPublished - 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-1

Fingerprint

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