@book{1c7be4fd7e2344fb830e9d4aeb6278da,
title = "Double-base scalar multiplication revisited",
abstract = "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\textasciicircum{}2+y\textasciicircum{}2=1+dx\textasciicircum{}2y\textasciicircum{}2 with small d. The previous record, 7.62M per bit, was unbeaten for seven years",
author = "D.J. Bernstein and C. Chuengsatiansup and T. Lange",
year = "2017",
language = "English",
series = "Cryptology ePrint Archive",
publisher = "International Association for Cryptologic Research",
}