标题:Faster ECC over F2521−1 (feat. NEON)
作者:Seo, Hwajeong ;Liu, Zhe ;Nogami, Yasuyuki ;Park, Taehwan ;Choi, Jongseok ;Zhou, Lu ;Kim, Howon
通讯作者:Kim, Howon
作者机构:[Seo, Hwajeong ;Park, Taehwan ;Choi, Jongseok ;Kim, Howon ] School of Computer Science and Engineering, Pusan National University, San-30, Jangjeon-Do 更多
会议名称:18th International Conference on Information Security and Cryptology, ICISC 2015
会议日期:November 25, 2015 - November 27, 2015
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版年:2016
卷:9558
页码:169-181
DOI:10.1007/978-3-319-30840-1_11
摘要: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’s (and SECG’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’s ECDH speed test for curve P-521 requires 23.8/18.7M cycles for ARM Cortex-A9/A15, respectively.
© Springer International Publishing Switzerland 2016.
收录类别:EI
资源类型:会议论文
TOP