Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Kooshiar Azimian:

TR05-124 | 2nd November 2005
Kooshiar Azimian

Breaking Diffie-Hellman is no Easier than Root Finding

In this paper we compare hardness of two well known problems: the Diffie-Hellman problem and the root finding problem. We prove that in any cyclic group computing Diffie-Hellman is not weaker than root finding if certain circumstances are met. As will be discussed in the paper this theorem can affect ... more >>>

TR05-078 | 25th May 2005
Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh, Siamak Fayyaz

A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme

Revisions: 1

In this paper, firstly we propose two new concepts concerning the notion of key escrow encryption schemes: provable partiality and independency. Roughly speaking we say that a scheme has provable partiality if existing polynomial time algorithm for recovering the secret knowing escrowed information implies a polynomial time algorithm that can ... more >>>

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