Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Benny Chor, Oded Goldreich (1984)

> Home

Details and statistics

DOI: 10.1007/3-540-39568-7_24

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/crypto/Goldreich84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/Goldreich84
Benny Chor, Oded Goldreich:
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. CRYPTO 1984: 303-313

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.