How to compute modular exponentiation with large operators based on the right-to-left binary algorithm

DOI10.1016/J.AMC.2005.09.062MaRDI QIDQ2493773zbMATH OpenOpenAlexFDO

Authors Da-Zhi Sun, Yu Sun, Zhenfu Cao

Publication date 16 June 2006

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2005.09.062

zbMATH Keywords

\(t\)-fold exponent methodcomputer algebra systemframeworkmodular exponentiationperformanceright-to-left binary algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast exponentiation by folding the signed-digit exponent in half
• A high performance ROM-based structure for modular exponentiation
• An algorithm for modular exponentiation.
• scientific article; zbMATH DE number 1946644
• New modular multiplication algorithms for fast modular exponentiation

Cites work

• A Survey of Fast Exponentiation Methods
• Analysis of sliding window techniques for exponentiation
• Analysis of the sliding window powering algorithm
• Analysis of the variable length nonzero window method for exponentiation
• Computing Sequences with Addition Chains
• Counting Points on Elliptic Curves Over F 2 m
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Remarks on number theory III. On addition chains

Cited in

(2)

• An optimization of tree topology based parallel cryptography
• A low-complexity LUT-based squaring algorithm

This page was built for publication: How to compute modular exponentiation with large operators based on the right-to-left binary algorithm

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