## Abstract

This paper investigates performance and energy characteristics of software algorithms for long integer arithmetic. We analyze and compare the number of RISC-like processor instructions (e.g. single-precision multiplication, addition, load, and store instructions) required for the execution of different algorithms such as Schoolbook multiplication, Karatsuba and Comba multiplication, as well as Montgomery reduction. Our analysis shows that a combination of Karatsuba-Comba multiplication and Montgomery reduction (the so-called KCM method) allows to achieve better performance than other algorithms for modular multiplication. Furthermore, we present a simple model to compare the energy-efficiency of arithmetic algorithms. This model considers the clock cycles and average current consumption of the base instructions to estimate the overall amount of energy consumed during the execution of an algorithm. Our experiments, conducted on a StrongARM SA-1100 processor, indicate that a 1024-bit KCM multiplication consumes about 22% less energy than other modular multiplication techniques.

Original language | English |
---|---|

Pages (from-to) | 75-90 |

Number of pages | 16 |

Journal | Lecture Notes in Computer Science |

Volume | 3659 |

DOIs | |

State | Published - 2005 |

Externally published | Yes |

Event | 7th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2005 - Edinburgh, United Kingdom Duration: 29 Aug 2005 → 1 Sep 2005 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)