Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PUBLIC-KEY:
Reports tagged with Public-Key:
TR05-047 | 10th April 2005
Kooshiar Azimian, Mahmoud Salmasizadeh, Javad Mohajeri

Weak Composite Diffie-Hellman is not Weaker than Factoring

In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman [Sh85]. The Theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic poly-time oracle machine which solves the Diffie-Hellman modulo an
RSA-number with odd-order base then there exist a probabilistic algorithm which factors the modulo. ... more >>>




ISSN 1433-8092 | Imprint