Next: On the (Im)possibility of
Up: Back at Weizmann (1998-2003)
Previous: Candidate One-Way Functions Based
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
- Journal of Cryptology, Vol. 16, pages 71-93, 2003.
Oded Goldreich
2003-07-30