132 search results - page 6 / 27 » Spectral Modular Exponentiation |
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
RECONFIG
2008
IEEE
14 years 2 months ago
2008
IEEE
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...
FPL
2005
Springer
14 years 1 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...
JUCS
2010
13 years 6 months ago
2010
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
AINA
2003
IEEE
14 years 1 months ago
2003
IEEE
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...