International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Long Modular Multiplication for Cryptographic Applications

Authors:
Laszlo Hars
Download:
URL: http://eprint.iacr.org/2004/198
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12170,
  title={Long Modular Multiplication for Cryptographic Applications},
  booktitle={IACR Eprint archive},
  keywords={implementation / Computer Arithmetic, Modular multiplication, Modular reduction, Montgomery multiplication, Quisquater multiplication, Multiply-accumulate architecture, Reciprocal},
  url={http://eprint.iacr.org/2004/198},
  note={CHES 2004 (Publisher damaged the copy in the proceedings LNCS 3156) Laszlo@Hars.US 12644 received 14 Aug 2004},
  author={Laszlo Hars},
  year=2004
}