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.
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.