91 search results - page 1 / 19 » Weak Composite Diffie-Hellman |
IJNSEC
2008
13 years 7 months ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
SEC
1993
13 years 8 months ago
1993
We describe public key cryptosystems and analyse the RSA cryptosystem, pointing out a weakness (already known) of the RSA system. We define Lucas functions and derive some of thei...
IJNSEC
2008
13 years 7 months ago
2008
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...