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

Werner Alexi et al. (1984)

> Home

Details and statistics

DOI: 10.1109/SFCS.1984.715947

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/AlexiCGS84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/AlexiCGS84
Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr:
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure. FOCS 1984: 449-457

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.