How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
Authors:
- Da-Zhi SunDSDa-Zhi Sun
- Zhen-Fu CaoZCZhen-Fu Cao
- 1 May 2006
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 176 (1) , 280-292
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Analysis of the Sliding Window Powering AlgorithmJournal of Cryptology, 2004
- Analysis of the variable length nonzero window method for exponentiationComputers & Mathematics with Applications, 1999
- An adaptive exponentiation methodJournal of Systems and Software, 1998
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- Fast exponentiation methodby folding exponent in halfElectronics Letters, 1996
- Analysis of sliding window techniques for exponentiationComputers & Mathematics with Applications, 1995
- Common-multiplicand multiplication and its applications to public key cryptographyElectronics Letters, 1993
- Architectures for exponentiation in GF(2/sup m/)IEEE Journal on Selected Areas in Communications, 1988
- Computing Sequences with Addition ChainsSIAM Journal on Computing, 1981
- Remarks on number theory III. On addition chainsActa Arithmetica, 1960