Still faster modular multiplication

Electronics Letters

Volumn 31, Issue 4, 1995, Pages 263-264

  Walter, C D ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Cryptography; Digital arithmetic; Public key cryptography

Indexed keywords

ADDERS; ALGORITHMS; BINARY SEQUENCES; CRITICAL PATH ANALYSIS; CRYPTOGRAPHY; DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS; REDUNDANCY;

DECRYPTION; MODULAR MULTIPLICATION; MONTGOMERY ALGORITHM; PUBLIC KEY CRYPTOGRAPHY;

DIGITAL ARITHMETIC;

EID: 0029254488     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19950217     Document Type: Article

References (6)

1. RIVEST, R.L., SHAMIR. A., and ADLEMAN, L.: ‘A method for obtaining digital signatures and public-key cryptosystems’, Commun. ACM, 1978, 21, pp. 120-126
2. BRICKELL, E.F.: ‘A fast modular multiplication algorithm with application to two-kwy cryptography’ in CHAUM et al. (Eds.): ‘Advances in Cryptology - CRYPYO ‘82’ (Plenum, New York. 1983), pp 51-60
3. MONTGOMERY, P.L.: ‘Modular multiplication without trial division’, Math. Comput., 1985, 44, pp. 519-521
4. SOLOVAY, R., and STRASSEN, V.: ‘A fast Monte-Carlo test for primality’, SIAM J. Comput., 1977, 6, pp. 84-85
5. WALTER, C.D.: ‘Faster modular multiplication by operand scaling’. Advances in Cryptology - CRYPTO ‘91, Lecture Notes in Comp. Sci, vol. 576, 1992, pp. 131-323 (Springer-Verlag)
6. WALTER, C.D., and ELDRIDGE, S.E.: ‘Hardware implementation of Montgomery's modular multiplication algorithm’, IEEE Trans., 1993, C-42, pp. 693-699