Skip to content
BY-NC-ND 3.0 license Open Access Published by De Gruyter August 19, 2009

Subset sum pseudorandom numbers: fast generation and distribution

  • Joachim von zur Gathen and Igor E. Shparlinski

Abstract

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.

Received: 2008-08-01
Revised: 2009-05-31
Published Online: 2009-08-19
Published in Print: 2009-August

© de Gruyter 2009

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Downloaded on 4.8.2023 from https://www.degruyter.com/document/doi/10.1515/JMC.2009.007/html
Scroll to top button