@inproceedings{51a8c33a443b4b7b83908eba9a707ee8,
title = "Faster ECC over F2521−1 (feat. NEON)",
abstract = "In this paper, we present high speed parallel multiplication and squaring algorithms for the Mersenne prime 2521 − 1. We exploit 1- level Karatsuba method in order to provide asymptotically faster integer multiplication and fast reduction algorithms. With these optimization techniques, ECDH on NIST{\textquoteright}s (and SECG{\textquoteright}s) curve P-521 requires 8.1/4M cycles on an ARM Cortex-A9/A15, respectively. As a comparison, on the same architecture, the latest OpenSSL 1.0.2d{\textquoteright}s ECDH speed test for curve P-521 requires 23.8/18.7M cycles for ARM Cortex-A9/A15, respectively.",
keywords = "Elliptic curve cryptography, Karatsuba, NEON, P-521, SIMD",
author = "Hwajeong Seo and Zhe Liu and Yasuyuki Nogami and Taehwan Park and Jongseok Choi and Lu Zhou and Howon Kim",
year = "2016",
doi = "10.1007/978-3-319-30840-1_11",
language = "English",
isbn = "9783319308395",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "169--181",
editor = "Aaram Yun and Soonhak Kwon",
booktitle = "Information Security and Cryptology - ICISC 2015 - 18th International Conference, Revised Selected Papers",
note = "18th International Conference on Information Security and Cryptology, ICISC 2015 ; Conference date: 25-11-2015 Through 27-11-2015",
}