Optimizing Multiprecision Multiplication for Public Key Cryptography

Michael Scott; Piotr Szczechowiak

Paper 2007/299

Optimizing Multiprecision Multiplication for Public Key Cryptography

Michael Scott and Piotr Szczechowiak

Abstract

In this paper we recall the hybrid method of Gura et al. for multi-precision multiplication which is an improvement on the basic Comba method and which exploits the increased number of registers available on modern architectures in order to avoid duplicated loads from memory. We then show how to improve and generalise the method for application across a wide range of processor types, setting some new records in the process.

Note: A new section on the ARM processor added

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): mike @ computing dcu ie
History: 2008-02-11: last of 2 revisions; 2007-08-07: received; See all versions
Short URL: https://ia.cr/2007/299
License: CC BY

BibTeX

@misc{cryptoeprint:2007/299,
      author = {Michael Scott and Piotr Szczechowiak},
      title = {Optimizing Multiprecision Multiplication for Public Key Cryptography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/299},
      year = {2007},
      url = {https://eprint.iacr.org/2007/299}
}