You are looking at a specific version 20010227:185325 of this paper.
See the latest version.
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 sumrandomizer
- Contact author(s)
- ajohnst @ sandia gov
- History
- 2001-02-27: received
- Short URL
- https://ia.cr/2001/018
- License
-
CC BY