Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / subset sum, randomizer

Date: received 27 Feb 2001

Contact author: ajohnst at sandia gov

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20010227:185325 (All versions of this report)

Short URL: ia.cr/2001/018

Discussion forum: Show discussion | Start new discussion