Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-21527
Climent, J J; Gorla, E; Rosenthal, J (2007). Cryptanalysis of the CFVZ cryptosystem. Advances in Mathematics of Communications, 1(1):1-11.
View at publisher
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.
18 downloads since deposited on 08 Dec 2009
8 downloads since 12 months
|Item Type:||Journal Article, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Dewey Decimal Classification:||510 Mathematics|
|Deposited On:||08 Dec 2009 08:18|
|Last Modified:||17 Oct 2012 21:53|
|Publisher:||American Institute of Mathematical Sciences|
|Additional Information:||First published in Advances in Mathematics of Communication in vol. 1, no. 1 (2007), published by the American Institute of Mathematical Sciences and Shandong University|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page