**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.

**Category / Keywords: **public-key cryptography / cryptanalysis, cryptographic protocols, one-way functions

**Date: **received 13 Feb 2006

**Contact author: **elisa gorla at math unizh ch

**Available format(s): **Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

**Version: **20060214:163234 (All versions of this report)

**Short URL: **ia.cr/2006/053

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]