Analysis of a Subset Sum Randomizer

Peter Gemmell; Anna Johnston

Paper 2001/018 Original: eprint.iacr.org/2001/018 ↗

Analysis of a Subset Sum Randomizer

Peter Gemmell

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): PDF
Category: Foundations
Publication info: Preprint.
History: 2001-02-27: last updated; 2001-02-27: published
Short URL: https://ia.cr/2001/018
License: https://creativecommons.org/licenses/by/4.0/

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