References
- Brickell , Ernest F. “ A fast modular multiplication algorithm with application to two key cryptography ” . In Advances in Cryptology , 51 – 60 . Plenum . Proceedings of CRYPTO 82
- Baker , P. W. 1987 . Fast computation of A * B modulo N . Electronics Letters , 23 ( 15 ) July : 794 – 795 .
- Montgomery , P. L. 1985 . Modular multiplication without trial division . Mathematics of Computation , 44 ( 170 ) April : 519 – 521 .
- Blakley , G. B. 1983 . A computer algorithm for calculating the product AB modulo M . IEEE Transactions on Computers , C-32 ( 5 ) May : 497 – 500 .
- Takagi , N. and Yajima , S. 1992 . Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem . IEEE Transaction on Computers , 41 ( 7 ) July : 887 – 891 .
- Orup , H. 1995 . Proc. of the 12 th Symposium on Computer Arithmetic . Simplifying quotient determination in high-radix modular multiplication . July 19-21 1995 , Bath, England. pp. 193 – 199 .
- Chiou , C. W. and Yang , T. C . 1994 . Iterative modular multiplication algorithm without magnitude comparison . Electronics Letters , 30 ( 24 ) November : 2017 – 2018 . 24th