Faster Double-Size Modular Multiplication from Euclidean Multipliers

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, RS...

• Type: Conference
• Year: 2003
• Where: CHES
• Authors: Benoît Chevallier-Mames, Marc Joye, Pascal Paillier
• Keywords: 2n-bit Modular Multiplication, CHES 2003, Cryptography, Modular Multiplication, Specific Modular Multiplication