Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring
Home
Publications
Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring
Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring
Eli Biham
Eli Biham
Dan Boneh
Dan Boneh
Omer Reingold
Omer Reingold
Publisher Website
Google Scholar
Add to library
Cite
Download
Share
Download
30 April 1999
journal article
Published by
Elsevier
in
Information Processing Letters
Vol. 70
(2)
,
83-87
https://doi.org/10.1016/s0020-0190(99)00047-2
Abstract
No abstract available
Keywords
CRYPTOGRAPHY
DIFFIE–HELLMAN ASSUMPTION
FACTORING
KEY-EXCHANGE
PSEUDO-RANDOM FUNCTION
Cited by 35 articles