International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Optimizing Multiprecision Multiplication for Public Key Cryptography

Authors:
Michael Scott
Piotr Szczechowiak
Download:
URL: http://eprint.iacr.org/2007/299
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2007-13579,
  title={Optimizing Multiprecision Multiplication for Public Key Cryptography},
  booktitle={IACR Eprint archive},
  keywords={implementation /},
  url={http://eprint.iacr.org/2007/299},
  note={ mike@computing.dcu.ie 13797 received 1 Aug 2007, last revised 11 Oct 2007},
  author={Michael Scott and Piotr Szczechowiak},
  year=2007
}