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