[Resource Topic] 2006/321: Efficient Pseudorandom Generators Based on the DDH Assumption

Welcome to the resource topic for 2006/321

Efficient Pseudorandom Generators Based on the DDH Assumption

Authors: Reza Rezaeian Farashahi, Berry Schoenmakers, Andrey Sidorenko


A family of pseudorandom generators based on the decisional Diffie-Hellman assumption is proposed. The new construction is a modified and generalized version of the Dual Elliptic Curve generator proposed by Barker and Kelsey. Although the original Dual Elliptic Curve generator is shown to be insecure, the modified version is provably secure and very efficient in comparison with the other pseudorandom generators based on discrete log assumptions. Our generator can be based on any group of prime order provided that an additional requirement is met (i.e., there exists an efficiently computable function that in some sense enumerates the elements of the group). Two specific instances are presented. The techniques used to design the instances, for example, the new probabilistic randomness extractor are of independent interest for other applications.

ePrint: https://eprint.iacr.org/2006/321

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .