### Fast modular squaring with AVX512IFMA

Nir Drucker and Shay Gueron

##### Abstract

Modular exponentiation represents a signicant workload for public key cryptosystems. Examples include not only the classical RSA, DSA, and DH algorithms, but also the partially homomorphic Paillier encryption. As a result, efficient software implementations of modular exponentiation are an important target for optimization. This paper studies methods for using Intel's forthcoming AVX512 Integer Fused Multiply Accumulate (AVX512IFMA) instructions in order to speed up modular (Montgomery) squaring, which dominates the cost of the exponentiation. We further show how a minor tweak in the architectural definition of AVX512IFMA has the potential to further speed up modular squaring.

Available format(s)
Category
Implementation
Publication info
Preprint. MINOR revision.
Contact author(s)
drucker nir @ gmail com
History
Short URL
https://ia.cr/2018/335

CC BY

BibTeX

@misc{cryptoeprint:2018/335,
author = {Nir Drucker and Shay Gueron},
title = {Fast modular squaring with AVX512IFMA},
howpublished = {Cryptology ePrint Archive, Paper 2018/335},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/335}},
url = {https://eprint.iacr.org/2018/335}
}

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