Welcome to the resource topic for 2000/064
Title:
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators
Authors: Oded Goldreich, Vered Rosen
Abstract:Assuming the inractability of factoring, we show that
the output of the exponentiation modulo a composite function
f_{N,g}(x)=g^x\bmod N (where N=P\cdot Q) is pseudorandom,
even when its input is restricted to be half the size.
This result is equivalent to the simultaneous hardness of the upper
half of the bits of f_{N,g},
proven by Hastad, Schrift and Shamir.
Yet, we supply a different proof that is significantly simpler
than the original one. In addition, we suggest a pseudorandom generator
which is more efficient than all previously known factoring
based pseudorandom generators.
ePrint: https://eprint.iacr.org/2000/064
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 .