Computer Science – Cryptography and Security
Scientific paper
2006-02-10
Computer Science
Cryptography and Security
12 pages
Scientific paper
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.
Climent J. J.
Gorla Elisa
Rosenthal Joachim
No associations
LandOfFree
Cryptanalysis of the CFVZ cryptosystem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cryptanalysis of the CFVZ cryptosystem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptanalysis of the CFVZ cryptosystem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-599979