Fast group operations on elliptic curves in Maple (Q1806495): Difference between revisions

This paper is written at the level of an undergraduate project. The paper claims to give a fast method for performing point multiplication on elliptic curves, but this amounts to a description of the standard (and slow) basic binary method. There is no description of advanced (and fast) techniques such as those based on signed sliding windows. The authors also claim to give a speed up which would work on a parallel computer, but this does not actually work. Finally the paper discusses a massively parallel method to compute discrete logarithms on an elliptic curve. However this also has significant flaws. The authors seem unaware of the large body of work on implementation issues for elliptic curves and the work on parallel methods to solve the elliptic curve discrete logarithm problem.