Provably secure and efficient pseudorandom number generation
US8824677B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 29, 2009 |
| Grant date | Sep 2, 2014 |
| Priority date | — |
| Expiry date | Jan 10, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/0869
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A pseudorandom number is generated from a random seed number using a collision-resistant hash function. A iteration input is extracted from the seed number. A hardcore predicate is applied to the iteration input to generate a pseudorandom bit. A pairwise-independent function is identified using a pairwise-independent function identifier extracted from the seed number and applied to the iteration input to produce a randomized iteration input. The collision-resistant hash function is applied to the randomized iteration input to produce a hash result and pad the output. The padded hash result is assigned as the iteration input for the next iteration. The process repeats iteratively and pseudorandom bits are generated using the hardcore predicate in each iteration until a predetermined number of pseudorandom bits are generated. The pseudorandom number is constructed using the generated pseudorandom bits.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.