6 search results - page 1 / 2 » Faster Interleaved Modular Multiplication Based on Barrett a... |
TC
2010
12 years 11 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
CHES
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A digit-serial, multiplier-accumulator based cryptographic coprocessor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modula...
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...