Subset sum pseudorandom numbers : fast generation and distribution | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/132545

27 Visitors

44 Hits

5 Downloads

Title: Subset sum pseudorandom numbers : fast generation and distribution
Related: Journal of mathematical cryptology, Vol. 3, No. 2, (2009), p.149-163
DOI: 10.1515/JMC.2009.007
Publisher: Walter de Gruyter
Date: 2009
FoR/RFCD Code(s): 080400 Data Format 010200 Applied Mathematics
Author/Creator: von zur Gathen, Joachim
Author/Creator: Shparlinski, Igor E
Description: We show how to accelerate the subset sum pseudorandom number generator with arbitrary weights. Some special choices of weights speed up the naive usage of this generator without losing the property of uniform distribution which has recently been established in the general case. Our results confirm that this generator can be useful for both cryptographic and Quasi Monte Carlo applications.
Description: 15 page(s)
Subject Keyword: 080400 Data Format
Subject Keyword: 010200 Applied Mathematics
Subject Keyword: pseudorandom numbers
Subject Keyword: subset sum problem
Subject Keyword: knapsack problem
Subject Keyword: exponential sums
Resource Type: journal article
Organisation: Macquarie University. Dept. of Computing

Identifier: http://hdl.handle.net/1959.14/132545
Identifier: ISSN:1862-2976
Identifier: mq-rm-2009006261
Language: eng
Rights: Copyright 2009 by de Gruyter. Article originally published in Journal of Mathematical Cryptology, Volume 3, Issue 2, Pages 149–163. The original article can be found at http://dx.doi.org/10.1515/JMC.2009.007. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.
Reviewed

Macquarie University ResearchOnline