RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure.

Benny Chor Oded Goldreich

Published in: CRYPTO (1984)

Keyphrases

key exchange
digital signature
digital signature scheme
lower bound
public key
private key
similarity search
signature scheme
security analysis