Subset sum pseudorandom numbers

Fast generation and distribution

Joachim Von Zur Gathen*, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticle

2 Citations (Scopus)
1 Downloads (Pure)

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.

Original languageEnglish
Pages (from-to)149-163
Number of pages15
JournalJournal of Mathematical Cryptology
Volume3
Issue number2
DOIs
Publication statusPublished - Aug 2009

Bibliographical note

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.

Fingerprint Dive into the research topics of 'Subset sum pseudorandom numbers: Fast generation and distribution'. Together they form a unique fingerprint.

  • Cite this