You are looking at a specific version 20060214:163234 of this paper. See the latest version.

Paper 2006/053

Cryptanalysis of the CFVZ cryptosystem

J. J. Climent and E. Gorla and J. Rosenthal

Abstract

The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system is dominated by the complexity of solving a fixed number of discrete logarithm problems in the group of an elliptic curve. Using an adapted Pollard rho algorithm it is shown that this problem is essentially as hard as solving one discrete logarithm problem in the group of an elliptic curve.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
cryptanalysiscryptographic protocolsone-way functions
Contact author(s)
elisa gorla @ math unizh ch
History
2006-02-14: received
Short URL
https://ia.cr/2006/053
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.