Abstract
This paper sets new software speed records for high-security Diffie-Hellman computations, specifically 251-bit elliptic-curve variable-base-point scalar multiplication. In one second of computation on a $200 Core 2 Quad Q6600 CPU, this paper's software performs 30000 251-bit scalar multiplications on the binary Edwards curve d(x + x2 + y + y2) = (x + x 2)(y + y2) over the field where d = t57 + t54 + t44 + 1. The paper'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. © 2009 Springer.
Author supplied keywords
Cite
CITATION STYLE
Bernstein, D. J. (2009). Batch binary Edwards. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5677 LNCS, pp. 317–336). https://doi.org/10.1007/978-3-642-03356-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
