A faster modular multiplication algorithm
- 1 January 1991
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 40 (1-2) , 63-68
- https://doi.org/10.1080/00207169108804001
Abstract
This paper describes a method for quickly computing AB mod N where N is odd. It is shown to have significant advantages over other algorithms which make it suitable for use in hardware for public key encryption. Such hardware could run at approximately twice the speed of the best currently available.Keywords
This publication has 4 references indexed in Scilit:
- Fast modular multiplication using 2-power radixInternational Journal of Computer Mathematics, 1991
- A verification of brickell's fast modular multiplication algorithmInternational Journal of Computer Mathematics, 1990
- Modular multiplication without trial divisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978