Faster Double-Size Modular Multiplication from Euclidean Multipliers

  • Benoît Chevallier-Mames
  • Marc Joye
  • Pascal Paillier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2779)

Abstract

A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an Euclidean division based instruction returning not only the remainder but also the integer quotient resulting from a modular multiplication, i.e. on input x, y and z, both ⌊xy/ z⌋ and xy mod z are returned. A second algorithm making use of a special modular ‘multiply-and-accumulate’ instruction was also proposed.

In this paper, we improve on these algorithms and propose more advanced computational strategies with fewer calls to these basic operations, bringing in a speed-up factor up to 57%. Besides, when Euclidean multiplications themselves have to be emulated in software, we propose a specific modular multiplication based algorithm which surpasses original algorithms in performance by 71%.

Keywords

Modular multiplication crypto-processors embedded cryptographic software efficient implementations RSA 

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Benoît Chevallier-Mames
    • 1
  • Marc Joye
    • 1
  • Pascal Paillier
    • 2
  1. 1.Gemplus, Card Security Group, La VigieLa CiotatFrance
  2. 2.Gemplus, Cryptography GroupIssy-les-MoulineauxFrance

Personalised recommendations