93 search results - page 4 / 19 » Applications of The Montgomery Exponent |
ARITH
2005
IEEE
14 years 29 days 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...
CHES
2004
Springer
14 years 23 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...
FPL
2005
Springer
14 years 26 days 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...
PKC
2005
Springer
14 years 25 days ago
2005
Springer
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
ACISP
2005
Springer
14 years 27 days ago
2005
Springer
We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanc...