67 search results - page 4 / 14 » Montgomery Modular Multiplication Algorithm on Multi-Core Sy... |
ARITH
2003
IEEE
14 years 23 days ago
2003
IEEE
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
ARITH
1999
IEEE
13 years 11 months ago
1999
IEEE
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
CHES
2000
Springer
13 years 11 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
CHES
2004
Springer
14 years 26 days 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...
CRYPTO
1993
Springer
13 years 11 months ago
1993
Springer
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...