@inproceedings{a751dd1b757c47868177f62768cc83a3,
title = "Batch Binary Edwards",
abstract = "This paper sets new software speed records for high-security Diffie-Hellman computations, specifically 251-bit elliptic-curve variablebase-point scalar multiplication. In one second of computation on a $200 Core 2 Quad Q6600 CPU, this paper{\textquoteright}s software performs 30000 251-bit scalar multiplications on the binary Edwards curve d(x+x2 +y +y2) = (x + x2)(y + y2) over the field F2[t]/(t251 + t7 + t4 + t2 + 1) where d = t57 + t54 + t44 + 1. The paper{\textquoteright}s field-arithmetic techniques can be applied in much more generality but have a particularly efficient interaction with the completeness of addition formulas for binary Edwards curves.",
author = "D.J. Bernstein",
year = "2009",
doi = "10.1007/978-3-642-03356-8_19",
language = "English",
isbn = "978-3-642-03355-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "317--336",
editor = "S. Halevi",
booktitle = "Advances in Cryptology - CRYPTO 2009 (29th Annual International Cryptology ConferenceSanta Barbara CA, USA, August 16-20, 2009. Proceedings)",
address = "Germany",
}