53
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A fast modular multiplication algorithm

Pages 11-17 | Published online: 30 Mar 2007

References

  • Rivest , R.L. , Shamir , A. and Adleman , L. 1978 . A method for obtaining digital signatures and public-key cryptosystems . Comm. of ACM , 21 ( 2 ) February : 120 – 126 .
  • Baker , P.W. 1987 . Fast computation of A*B modulo N . Electron. Lett , 23 ( 15 ) July : 794 – 795 .
  • Kawamura , S. and Hirano , K. 1988 . A fast arithmetic algorithm using a residue table, Advances inCryptology . Proc. EUROCRYPT′88, Springer LNCS , 330 July : 245 – 250 .
  • Morita , H. 1990 . A fast modular-multiplication algorithm based on a radix 4 and its application . The Transactions of the IEICE , E73 July : 1081 – 1086 .
  • Kawamura , S. , Takabayashi , K. and Shimbo , A. 1991 . A fast modular exponentiation algorithm . IEICE Transactions , E74 ( 8 ) August : 2136 – 2142 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.