Faster ECC over F2571 (feat. PMULL)

Hwajeong Seo

Abstract

In this paper, we show efficient elliptic curve cryptography implementations for B-571 over ARMv8. We improve the previous binary field multiplication with finely aligned multiplication and incomplete reduction techniques by taking advantages of advanced 64-bit polynomial multiplication (\texttt{PMULL}) supported by ARMv8. This approach shows performance enhancements by a factor of 1.34 times than previous binary field implementations. For the point addition and doubling, the special types of multiplication, squaring and addition operations are combined together and optimized, where one reduction operation is optimized in each case. The scalar multiplication is implemented in constant-time Montgomery ladder algorithm, which is secure against timing attacks. Finally the proposed implementations achieved 759,630/331,944 clock cycles for random/fixed scalar multiplications for B-571 over ARMv8, respectively.

Metadata
Available format(s)
Publication info
Preprint. MINOR revision.
Keywords
ARMv8Elliptic Curve CryptographyBinary Field Multiplication
Contact author(s)
hwajeong84 @ gmail com
History
2016-09-14: last of 3 revisions
2015-07-24: received
See all versions
Short URL
https://ia.cr/2015/745
License

CC BY

BibTeX

@misc{cryptoeprint:2015/745,
author = {Hwajeong Seo},
title = {Faster ECC over F2571 (feat. PMULL)},
howpublished = {Cryptology ePrint Archive, Paper 2015/745},
year = {2015},
note = {\url{https://eprint.iacr.org/2015/745}},
url = {https://eprint.iacr.org/2015/745}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.