A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation

Information Processing Letters

Volumn 66, Issue 2, 1998, Pages 105-107

  Ha, Jae Cheol ^a   Moon, Sang Jae ^b  

^a Korea Nazarene University   (South Korea)

^b Kyungpook National University   (South Korea)

Author keywords

Common multiplicand multiplication; Cryptography; Fast exponentiation; Modular arithmetic; Public key cryptosystem

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; DIGITAL ARITHMETIC;

COMMON MULTIPLICAND MULTIPLICATION; FAST EXPONENTIATION; MONTGOMERY ALGORITHMS;

CRYPTOGRAPHY;

EID: 0032048445     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00031-3     Document Type: Article

References (7)

1. M. Abdelguerfi, B.S. Kaliski Jr, W. Patterson, Public key security systems. IEEE Micro 16 (1996) 10-13.
2. P. Barret, Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signature processor, in: Proc. CRYPTO'86, 1986, pp. 311-323.
3. S.R. Dusse, B.S. Kaliski, A cryptographic library for the Motorola DSP 56000, in: Proc. EUROCRYPT'90, 1990, pp. 230-244.
4. T. ElGamal, A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31 (1985) 469-472.
5. D.E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, 1981.
6. P.L. Montgomery, Modular multiplication without trial division, Math. Comp. 44 (1985) 519-521.
7. R. Rivest, A. Shamir, L. Adleman, On digital signatures and public key cryptosystems, Comm. ACM 21 (1978) 120-126.