Pseudorandom number generation with expander graphs

Details Pseudorandom number generation with expander graphs Pseudorandom number generation with expander graphs

2011-03-15

2011-03-15

Hoffman, Brandon S (Department: 2433)

Cryptography

Key management

Having particular key generator

C380S028000, C380S029000, C380S042000

Reexamination Certificate

active

07907726

ABSTRACT:
Pseudorandom numbers may be generated from input seeds using expander graphs. Expander graphs are a collection of vertices that are interconnected via edges. Generally, a walk around an expander graph is determined responsive to an input seed, and a pseudorandom number is produced based on vertex names. Specifically, a next edge, which is one of multiple edges emanating from a current vertex, is selected responsive to an extracted seed chunk. The next edge is traversed to reach a next vertex. The name of the next vertex is ascertained and used as a portion of the pseudorandom number being produced by the walk around the expander graph.

REFERENCES:
patent: 5515307 (1996-05-01), Aiello et al.
patent: 2005/0220302 (2005-10-01), Mironov et al.
A. Lubotzky, R. Phillips, P. Sarnak; Explicit Expanders and the Ramanujan Conjectures; 1986; ACM—Annual ACM Symposium on Theory of Computing; p. 242; http://portal.acm.org/citation.cfm?id=12154 http://delivery.acm.org/10.1145/20000/12154/p240-lubotzky.pdf?key1=12154&key2=0039541521&coll=GUIDE&d1=GUIDE&CFID=49197537&CFTOKEN=84639923.
Guang Gong, Thomas A. Berson, and Douglas R. Stinson; Elliptic Curve Pseudorandom Sequence Generators; 2000; Springer Berlin/Heidelberg vol. 1758/2000; Lecture Notes in Computer Science—Selected Areas in Cryptography; p. 45; http://www.springerlink.com/content/2h1dkO3u7ntj1p8n/fulltext.pdf http://www.springerlink.com/content/2h1dk03u7ntj1p8n/.
A Pseudorandom Generator From Any One-Way Function Johan Hastad et al. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.36.6283&rep=rep1&type=pdf SIAM Journal on Computing; 1999 pp. 1-33.
Sprng: A Scalable Library for Pseudorandom Number Generation Michael Mascagni et al. ACM Transactions on Mathematical Software; 2000 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.93.7326&rep=rep1&type=pdf pp. 1-13.

Affiliated with

Also associated with

Rating

Pseudorandom number generation with expander graphs does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Pseudorandom number generation with expander graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudorandom number generation with expander graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2711013