Abstract
Since most public key cryptosystem primitives require the computation of modular exponentiation as their main building block, the problem of performing modular exponentiation efficiently has received considerable attention over the years. It is known that optimal (shortest) addition chains are the key mathematical concept for accomplishing modular exponentiations optimally. However, finding an optimal addition chain of length r is an NP-hard problem whose search space size is comparable to r !. In this contribution we explore the usage of a Genetic Algorithm (GA) approach for the problem of finding optimal (shortest) addition chains. We explain our GA strategy in detail reporting several promising experimental results that suggest that evolutionary algorithms may be a viable alternative to solve this illustrious problem in a quasi optimal fashion.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Knuth, D.: The Art of Computer Programming, 3rd edn. Addison-Wesley, Reading (1997)
Menezes, A.J., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Gordon, D.M.: A Survey of Fast Exponentiation Methods. Journal of Algorithms 27(1), 129–146 (1998)
Cruz-Cortés, N., Rodríguez-Henríquez, F., Coello, C.: On the Optimal Computation of Finite Field Exponentiation. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 747–756. Springer, Heidelberg (2004)
Bos, J., Coster, M.: Addition Chain Heuristics. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 400–407. Springer, Heidelberg (1990)
Bergeron, F., Berstel, J., Brlek, S.: Efficient Computation of Addition Chains. Journal de theorie des nombres de Bordeaux 6, 21–38 (1994)
Bleinchenbacher, D., Flammenkamp, A.: An Efficient Algorithm for Computing Shortest Addition Chains (1997), Available at http://www.uni-bielefeld.de/~achim
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cruz-Cortés, N., Rodríguez-Henríquez, F., Juárez-Morales, R., Coello Coello, C.A. (2005). Finding Optimal Addition Chains Using a Genetic Algorithm Approach. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_30
Download citation
DOI: https://doi.org/10.1007/11596448_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)