next up previous
Next: On the (Im)possibility of Up: Back at Weizmann (1998-2003) Previous: Candidate One-Way Functions Based

On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators

Building on the work of Hastad, Schrift and Shamir, this work presents a simplified proof to the simultaneous security of the top bits with respect to exponentiation modulo a composite number.


Comments: Authored by O. Goldreich and V. Rosen. Appeared in



Oded Goldreich
2003-07-30