Cryptanalysis of the CFVZ cryptosystem

The paper analyzes CFVZ, 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. Hence, the CFVZ cryptosystem has no advantages over traditional elliptic curve cryptography and should not be used in practice.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Joan-Josep Climent, E. Gorla, J. Rosenthal
• Keywords: CORR 2006, Discrete Logarithm Problem, Education, Elliptic Curve, Public Key Cryptosystem