Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

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


Authors: Alessandro Conflitti and Igor E. Shparlinski
Journal: Math. Comp. 73 (2004), 1005-1011
MSC (2000): Primary 11K45, 11T71; Secondary 11T23, 94A60
Published electronically: September 2, 2003
MathSciNet review: 2031421
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11K45, 11T71, 11T23, 94A60

Retrieve articles in all journals with MSC (2000): 11K45, 11T71, 11T23, 94A60


Additional Information

Alessandro Conflitti
Affiliation: Dipartimento di Matematica, Università degli Studi di Roma “Tor Vergata”, Via della Ricerca Scientifica, I-00133 Roma, Italy
Email: conflitt@mat.uniroma2.it

Igor E. Shparlinski
Affiliation: Department of Computing, Macquarie University, Sydney, New South Wales 2109, Australia
Email: igor@ics.mq.edu.au

DOI: http://dx.doi.org/10.1090/S0025-5718-03-01563-1
PII: S 0025-5718(03)01563-1
Keywords: Pseudorandom numbers, subset sum problem, knapsack, exponential sums
Received by editor(s): December 5, 2001
Published electronically: September 2, 2003
Additional Notes: The first author would like to thank Macquarie University for its hospitality during the preparation of this paper
Article copyright: © Copyright 2003 American Mathematical Society