Paper 2004/198 Original: eprint.iacr.org/2004/198 ↗
Long Modular Multiplication for Cryptographic Applications
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2004-08-15: last updated
- 2004-08-15: published
- Short URL
- https://ia.cr/2004/198
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/198,
author = {Laszlo Hars},
title = {Long Modular Multiplication for Cryptographic Applications},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/198},
year = {2004},
url = {https://eprint.iacr.org/2004/198}
}