Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CRYPTO
/
Paper
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure.
Benny Chor
,
Oded Goldreich
Venue
A*
CRYPTO
Year
1984
Proceedings
CRYPTO
DBLP record
conf/crypto/Goldreich84 ↗
Browse the full
CRYPTO paper archive
.