Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation /

Date: received 1 Aug 2007, last revised 11 Feb 2008

Contact author: mike at computing dcu ie

Available format(s): PDF | BibTeX Citation

Note: A new section on the ARM processor added

Version: 20080211:174940 (All versions of this report)

Short URL: ia.cr/2007/299

Discussion forum: Show discussion | Start new discussion