Analysis of a Subset Sum Randomizer

Peter Gemmell; Anna Johnston

Paper 2001/018

Analysis of a Subset Sum Randomizer

Peter Gemmell and Anna Johnston

Abstract

In [5] an efficient pseudo-random number generator (PRNG) with provable security is described. Its security is based on the hardness of the subset sum or knapsack problem. In this paper we refine these ideas to design a PRNG with independent seed and output generation. This independence allows for greater parallelism, design flexibility, and possibly greater security.

Metadata

Available format(s): PS
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: subset sum randomizer
Contact author(s): ajohnst @ sandia gov
History: 2001-02-27: received
Short URL: https://ia.cr/2001/018
License: CC BY

BibTeX

@misc{cryptoeprint:2001/018,
      author = {Peter Gemmell and Anna Johnston},
      title = {Analysis of a Subset Sum Randomizer},
      howpublished = {Cryptology {ePrint} Archive, Paper 2001/018},
      year = {2001},
      url = {https://eprint.iacr.org/2001/018}
}