Cryptology ePrint Archive: Report 2004/198

Long Modular Multiplication for Cryptographic Applications

Laszlo Hars

Abstract: A digit-serial, multiplier-accumulator based cryptographic co-processor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modular arithmetic and general computations. Several new “column-sum” variants of popular quadratic time modular multiplication algorithms are presented (Montgomery and interleaved division-reduction with or without Quisquater scaling), which are faster than the traditional implemen-tations, need no or very little memory beyond the operand storage and perform squaring about twice faster than general multiplications or modular reductions. They provide similar advantages in software for general purpose CPU's.

Category / Keywords: implementation / Computer Arithmetic, Modular multiplication, Modular reduction, Montgomery multiplication, Quisquater multiplication, Multiply-accumulate architecture, Reciprocal

Publication Info: CHES 2004 (Publisher damaged the copy in the proceedings LNCS 3156)

Date: received 14 Aug 2004

Contact author: Laszlo at Hars US

Available formats: PDF | BibTeX Citation

Note: See also at http://www.hars.us/Papers/ModMult.pdf

Version: 20040815:212145 (All versions of this report)

Discussion forum: Show discussion | Start new discussion