Fast modular multiplication using 2-power radix

References

• Atkins , D. E. 1968 . Higher-radix division using estimates of the divisor and partial remainders . IEEE Trans. Comp. , C17 : 925 – 934 .
   Google Scholar
• Avizienis , A. 1961 . Signed digit number representations for fast parallel arithmetic . IEEE Trans. Elec. Comp. , EC10 : 389 – 400 .
   Google Scholar
• Brickell , E. F. 1983 . “ A fast modular multiplication algorithm with application to two key cryptography ” . In Advances in Cryptology , 51 – 60 . Plenum . Proc. of CRYPTO 82
   Google Scholar
• Gibson , J. K. 1988 . A generalisation of Brickell's algorithm for fast modular multiplication . BIT , 28 : 755 – 763 .
   Web of Science ®Google Scholar
• Rivest , R. L. , Shamir , A. and Adleman , L. 1978 . A method of obtaining digital signatures and public key cryptosystems . Comm. ACM , 21 : 120 – 126 .
   Web of Science ®Google Scholar
• Selby , A. and Mitchell , C. 1989 . Algorithms for software implementations of RSA . IEE Proc. , 136 : 166 – 170 . part E
   Google Scholar
• Simmons , G. J. and Norris , M. J. . Nat. Telecom. Conf . High speed arithmetic utilizing redundant number systems . 1980 , Houston. New York : IEEE . Texas 49.3/1-2
   Google Scholar
• Walter , C. D. and Eldridge , S. E. 1990 . A verification of Brickell's fast modular multiplication algorithm . Intern. J. Computer Math. , 33 : 153 – 169 .
   Web of Science ®Google Scholar