73
Views
2
CrossRef citations to date
0
Altmetric
Miscellany

Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques

Pages 1187-1202 | Received 27 Aug 2003, Published online: 25 Jan 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Chia-Long Wu. (2007) Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques. International Journal of Computer Mathematics 84:10, pages 1405-1415.
Read now

Articles from other publishers (1)

Chia-Long Wu & Chen-Hao Hu. (2012) Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application. Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application.

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.