How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
From MaRDI portal
Publication:2493773
DOI10.1016/j.amc.2005.09.062zbMath1092.68118MaRDI QIDQ2493773
Yu Sun, Da-Zhi Sun, Zhen Fu 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
performance; modular exponentiation; framework; computer algebra system; \(t\)-fold exponent method; right-to-left binary algorithm
68W30: Symbolic computation and algebraic computation
Related Items
A low-complexity LUT-based squaring algorithm, An optimization of tree topology based parallel cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of the sliding window powering algorithm
- Analysis of sliding window techniques for exponentiation
- Analysis of the variable length nonzero window method for exponentiation
- Computing Sequences with Addition Chains
- A Survey of Fast Exponentiation Methods
- Counting Points on Elliptic Curves Over F 2 m
- Remarks on number theory III. On addition chains