Paper 2007/299 Original: eprint.iacr.org/2007/299 ↗
Optimizing Multiprecision Multiplication for Public Key Cryptography
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2008-02-11: last updated
- 2007-08-07: published
- Short URL
- https://ia.cr/2007/299
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}