SIGN IN
SIGN UP
Efficient generation of shared RSA keys
Full Text:
PDF
Buy this Article
Authors:
Dan Boneh
Stanford University, Stanford, California
Matthew Franklin
University of California, Davis, California
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 48 Issue 4, July 2001
Pages 702-722
ACM
New York, NY
, USA
table of contents
doi>
10.1145/502090.502094
2001 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 79
· Downloads (cumulative): 2,072
· Citation Count: 20
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
multiparty computation
primality testing
public key cryptosystems
rsa
security
threshold cryptography
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder