International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Benny Chor
Oded Goldreich
Download:
DOI: 10.1007/3-540-39568-7_24 (login may be required)
Search ePrint
Search Google
Conference: CRYPTO 1984
BibTeX
@inproceedings{crypto-1984-1345,
  title={RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure},
  booktitle={Advances in Cryptology, Proceedings of CRYPTO '84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={196},
  pages={303-313},
  doi={10.1007/3-540-39568-7_24},
  author={Benny Chor and Oded Goldreich},
  year=1984
}