International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Analysis of a Subset Sum Randomizer

Authors:
Peter Gemmell
Anna Johnston
Download:
URL: http://eprint.iacr.org/2001/018
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2001-11430,
  title={Analysis of a Subset Sum Randomizer},
  booktitle={IACR Eprint archive},
  keywords={foundations / subset sum, randomizer},
  url={http://eprint.iacr.org/2001/018},
  note={ ajohnst@sandia.gov 11380 received 27 Feb 2001},
  author={Peter Gemmell and Anna Johnston},
  year=2001
}