A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A new fast modular multiplication method and its application to modular exponentiation-based cryptography

2000
*
Electronics and communications in Japan. Part 3, Fundamental electronic science
*

In order to apply exponentiation-based cryptography, such as RSA cryptography and El Gamal cryptography, to a wide range of practical problems, it is desired to devise faster ciphering and deciphering processes. This paper proposes a new algorithm for improving the speed of the exponentiation-based computation. The proposed method is based on the idea in the exponentiation computation that the remainder in square/multiplication with modulus n is constructed from the remainders with moduli

doi:10.1002/1520-6440(200012)83:12<88::aid-ecjc10>3.0.co;2-5
fatcat:lwhnilw75ncuzccsqm5cmgo4kq