Analysis of multi-exponentiation algorithm using binary signed-digit representations

DOI10.1142/S0219876209001814MaRDI QIDQ4924256zbMATH OpenOpenAlexFDO

Authors Da-Zhi Sun, Ji-Zhou Sun, Jian-Xin Li, Jin-Peng Huai

Publication date 31 May 2013

Published in International Journal of Computational Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219876209001814

zbMATH Keywords

binary signed-digit (BSD) representationcomplex arithmeticcomputational efficiencymulti-exponentiation

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Recommendations

• ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• A note on asynchronous multi-exponentiation algorithm using binary representation
• Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
• Signed bits and fast exponentiation

Cites work

• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Optimal left-to-right binary signed-digit recoding

Cited in

(3)

• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
• A note on asynchronous multi-exponentiation algorithm using binary representation

This page was built for publication: Analysis of multi-exponentiation algorithm using binary signed-digit representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924256)