Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors

  • Michael Hutter
  • Erich Wenger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6917)

Abstract

Multi-precision multiplication is one of the most fundamental operations on microprocessors to allow public-key cryptography such as RSA and Elliptic Curve Cryptography (ECC). In this paper, we present a novel multiplication technique that increases the performance of multiplication by sophisticated caching of operands. Our method significantly reduces the number of needed load instructions which is usually one of the most expensive operation on modern processors. We evaluate our new technique on an 8-bit ATmega128 microcontroller and compare the result with existing solutions. Our implementation needs only 2,395 clock cycles for a 160-bit multiplication which outperforms related work by a factor of 10% to 23%. The number of required load instructions is reduced from 167 (needed for the best known hybrid multiplication) to only 80. Our implementation scales very well even for larger Integer sizes (required for RSA) and limited register sets. It further fully complies to existing multiply-accumulate instructions that are integrated in most of the available processors.

Keywords

Multi-precision Arithmetic Microprocessors Elliptic Curve Cryptography RSA Embedded Devices 

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Michael Hutter
    • 1
  • Erich Wenger
    • 1
  1. 1.Institute for Applied Information Processing and Communications (IAIK)Graz University of TechnologyGrazAustria

Personalised recommendations