388 search results - page 2 / 78 » Bipartite Modular Multiplication |
FPL
2005
Springer
13 years 10 months ago
2005
Springer
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
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...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
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...
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...