Double-base scalar multiplication revisited
DJ Daniel Bernstein, Chitchanok Chuengsatiansup, T Tanja Lange · TU/e Research Portal · 2017
This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper's multiply-by-n algorithm takes just 7.47M per bit on twisted Edwards curves -x^2+y^2=1+dx^2y^2 with small d. The previous record, 7.62M per bit, was unbeaten for seven years