Method for generating pseudo-random numbers
US6285761A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Mar 4, 1998 |
| Grant date | Sep 4, 2001 |
| Priority date | — |
| Expiry date | Mar 4, 2018 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2207/581
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The present invention is a method for outputting larger bit size pseudo-random number z.sub.i that is cryptographically secure. Since larger bit size pseudo-random numbers are being outputted, larger bit size segments of messages may be encrypted resulting in a speedier encryption process than encryption processes of the prior art. In one embodiment, the present invention is a pseudo-random number generator defined by a modular exponential function EQU x.sub.i =g.sup.x.sup..sub.i-1 mod p. The output of the pseudo-random number generator being a pseudo-random number z.sub.i comprising a j-1 bit size segment of x.sub.i. The value of j being less than or equal to m-2c (i.e., j.ltoreq.m-2c). In an embodiment of the present invention, the pseudo-random number z.sub.i includes the j least significant bits of x.sub.i excluding the least significant bit of x.sub.i.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.