Faster ECC over F2521−1 (feat. NEON)

Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Taehwan Park, Jongseok Choi, Lu Zhou, Howon Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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’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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2015 - 18th International Conference, Revised Selected Papers
EditorsAaram Yun, Soonhak Kwon
PublisherSpringer Verlag
Pages169-181
Number of pages13
ISBN (Print)9783319308395
DOIs
Publication statusPublished - 2016
Event18th International Conference on Information Security and Cryptology, ICISC 2015 - Seoul, Korea, Republic of
Duration: Nov 25 2015Nov 27 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9558
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Conference on Information Security and Cryptology, ICISC 2015
Country/TerritoryKorea, Republic of
CitySeoul
Period11/25/1511/27/15

Keywords

  • Elliptic curve cryptography
  • Karatsuba
  • NEON
  • P-521
  • SIMD

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Faster ECC over F<sub>2</sub><sup>521</sup>−1 (feat. NEON)'. Together they form a unique fingerprint.

Cite this