Modular Exponentiation Using a Variable-Length Partition Method

Title & Authors
Modular Exponentiation Using a Variable-Length Partition Method
Lee, Sang-Un;

Abstract
The times of multiplication for encryption and decryption of cryptosystem is primarily determined by implementation efficiency of the modular exponentiation of $\small{a^b}$(mod m). The most frequently used among standard modular exponentiation methods is a standard binary method, of which n-ary($\small{2{\leq}n{\leq}6}$) is most popular. The n-ary($\small{1{\leq}n{\leq}6}$) is a square-and-multiply method which partitions \$b
Keywords
Modular exponentiation;Binary method;n-ary method;Fixed-length;Variable-length;
Language
Korean
Cited by
References
1.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms," 2nd Edition, McGrew-Hill Book Company, ISBN: 9780262033848, 2005.

2.
M. Alfred, P. C. Oorschot, AND S. A. Vanstone, "Handbook of Applied Cryptography," CRC Press, ISBN: 0-8493-8523-7, 1996.

3.
S. T. Klein, "Should One Always Use Repeated Squaring for Modular Exponentiation?," Information Processing Letters, Vol. 106, No. 6, pp. 232-237, doi:10.1016/j.ipl.2007.11.016, Jun. 2008.

4.
D. M. Gordon, "A Survey of Fast Exponentiation Methods," Journal of Algorithms, Vol. 27, No. 1, pp. 129-146, doi:10.1006/jagm.1997.0913, Apr. 1998.

5.
P. Montgomery, "Modular Multiplication Without Trial Division," Math. Computation, Vol. 44, pp. 519-521, doi: 10.1090/S0025-5718-1985-0777282-X, Apr. 1985.

6.
G. Saldamli and C. K. Koc, "Spectral Modular Exponentiation," Proc. of the 18th IEEE Symposium on Computer Arithmetic, pp. 123-132, doi: 10.1109/ARITH.2007.34, Jun. 2007.

7.
V. Gopal, J. Guilford, E. Ozturk, W. Feghali, G. Wolrich, and M. Dixon, "Fast and Constant-Time Implementation of Modular Exponentiation," 28th International Symposium on Reliable Distributed Systems, Niagara Falls, New York, U.S.A., Sep. 2009.

8.
L. Zhong, "Modular Exponentiation Algorithm Analysis for Energy Consumption and Performance," Technical Report CE-01-ZJL, Dept. of Electrical Engineering, Princeton University, 2001.

9.
J. Berstel, D. Perrin, and C. Reutenauer, 'Codes and Automata," Cambridge University Press, ISBN-13:978-0521888318, 2009.