Finding optimal addition chains using a genetic algorithm approach

Nareli Cruz-Cortés, Francisco Rodríguez-Henríquez, Raúl Juárez-Morales, Carlos A. Coello Coello

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

25 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaComputational Intelligence and Security - International Conference, CIS 2005, Proceedings
EditorialSpringer Verlag
Páginas208-215
Número de páginas8
ISBN (versión impresa)3540308180, 9783540308188
DOI
EstadoPublicada - 2005
Publicado de forma externa
EventoInternational Conference on Computational Intelligence and Security, CIS 2005 - Xi'an, China
Duración: 15 dic. 200519 dic. 2005

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen3801 LNAI
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

ConferenciaInternational Conference on Computational Intelligence and Security, CIS 2005
País/TerritorioChina
CiudadXi'an
Período15/12/0519/12/05

Huella

Profundice en los temas de investigación de 'Finding optimal addition chains using a genetic algorithm approach'. En conjunto forman una huella única.

Citar esto