Abstract
A digit-serial, multiplier-accumulator based cryptographic coprocessor 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 implementations, 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. © International Association for Cryptologic Research 2004.
Author supplied keywords
Cite
CITATION STYLE
Hars, L. (2004). Long modular multiplication for cryptographic applications. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3156, 45–61. https://doi.org/10.1007/978-3-540-28632-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
