Subset sum pseudorandom numbers: Fast generation and distribution

Joachim Von Zur Gathen; Igor E. Shparlinski

doi:10.1515/JMC.2009.007

Subset sum pseudorandom numbers: Fast generation and distribution

Joachim Von Zur Gathen^*, Igor E. Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

27 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 language	English
Pages (from-to)	149-163
Number of pages	15
Journal	Journal of Mathematical Cryptology
Volume	3
Issue number	2
DOIs	https://doi.org/10.1515/JMC.2009.007
Publication status	Published - 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.

Access to Document

10.1515/JMC.2009.007

Publisher version (open access).pdfFinal published version, 3.29 MB

Cite this

@article{9461187a7cc343619aeff77c6b63a717,

title = "Subset sum pseudorandom numbers: Fast generation and distribution",

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

author = "{Von Zur Gathen}, Joachim and Shparlinski, {Igor E.}",

note = "Copyright 2009 by de Gruyter. Article originally published in Journal of Mathematical Cryptology, Volume 3, Issue 2, Pages 149{\^a}€“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.",

year = "2009",

month = aug,

doi = "10.1515/JMC.2009.007",

language = "English",

volume = "3",

pages = "149--163",

journal = "Journal of Mathematical Cryptology",

issn = "1862-2976",

publisher = "De Gruyter",

number = "2",

}

TY - JOUR

T1 - Subset sum pseudorandom numbers

T2 - Fast generation and distribution

AU - Von Zur Gathen, Joachim

AU - Shparlinski, Igor E.

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

PY - 2009/8

Y1 - 2009/8

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

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

UR - http://www.scopus.com/inward/record.url?scp=79960003490&partnerID=8YFLogxK

U2 - 10.1515/JMC.2009.007

DO - 10.1515/JMC.2009.007

M3 - Article

AN - SCOPUS:79960003490

SN - 1862-2976

VL - 3

SP - 149

EP - 163

JO - Journal of Mathematical Cryptology

JF - Journal of Mathematical Cryptology

IS - 2

ER -

Subset sum pseudorandom numbers: Fast generation and distribution

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this