A faster modular multiplication algorithm

International Journal of Computer Mathematics

Volumn 40, Issue 1-2, 1991, Pages 63-68

  Eldridge, Stephen E ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

digital arithmetic; fast computer arithmetic; integer division; Modular multiplication; parallel bit operations; public key cryptography; redundant number systems; RSA algorithm

Indexed keywords

EID: 84954767265     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207169108804001     Document Type: Article

References (5)

1. E. F. Brickell, “A fast modular multiplication algorithm with application to two key cryptography”, Advances in Cryptography (Proceedings of CRYPTO 82) ed. Chaum et al., Plenum (1983), 51–60.
2. S. E. Eldridge and C. D. Walter, “A verification of Brickell's fast modular multiplication algorithm”, Int. J. Comput. Math, 33 (1990), 153–169.
3. P. L. Montgomery, “Modular multiplication without trial division”, Mathematics of Computation, 44, (1985), 519–521.
4. R. L. Rivest, A. Shamir and L. Adleman, “A method of obtaining digital signatures and public key cryptosystems”, Comm. ACM, 21 (1978), 120–126.
5. C. D. Walter, “Fast Modular Multiplication using 2-power radix”, Int. J. Comput. Math., 39 (1991), 21–28.