Cryptographically secure pseudo-random bit generator for fast and secure encryption
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 15, 2000
Grant Date -
N/A
app pub date -
Aug 15, 1997
filing date -
Aug 16, 1996
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A pseudo-random number generator is used as a pre-processing step to generating a long random bit string. The bit string is then 'stretched' by performing certain one-way functions in parallel on the bit strings. In a preferred embodiment, specialized constructions based on expander graphs are also used. Preferably, the strings generated by the one-way functions and expander graphs are exclusive-ored. An embodiment may operate in the following manner. Assume a slow but secure generator G.sub.0. 1. Using G.sub.0, generate random numbers x.sub.1, x.sub.2, . . . , x.sub.n. 2. Using a stretch function, stretch the random numbers into R=r.sub.1, r.sub.2, . . . , r.sub.n where each r.sub.i is a predetermined amount longer than x.sub.i. 3. Use R as a one-time pad for encryption. This process provides a long, random, cryptographically secure bit string. This bit string is sufficiently fast to support encryption processes suitable for real-time, on-line encryption, such as video stream encryption and TCP/IP layer encryption.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully