Cryptanalysis of the CFVZ cryptosystem
Copyright policy )Cryptanalysis of the CFVZ cryptosystem
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.
12 pages
- University of Zurich Switzerland
- University of Alicante Spain
FOS: Computer and information sciences, 10123 Institute of Mathematics, 510 Mathematics, Computer Science - Cryptography and Security, Cryptography and Security (cs.CR)
FOS: Computer and information sciences, 10123 Institute of Mathematics, 510 Mathematics, Computer Science - Cryptography and Security, Cryptography and Security (cs.CR)
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!