Hamdi Tounsi (hamdi@ati.tn)
Mon, 06 Jul 1998 10:20:28 +0200
Hi all
quoting from the recent bulletin by rsa labs about the pkcs#1 problem :
"The ability to predict certain bits of an RSA decryption has previously
been shown to provide a means for computing all bits of a decryption"
there was a reference to a paper by alexi, chor, goldreich and schnorr
(SIAM journal on computing, April 88) named "RSA and Rabin funcitons:
certain parts are as hard as the whole"
do someone have more information on this ? unfortunetly, that paper is
not in the siam's online library
best regards
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:20:06 ADT