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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

25 Scopus citations

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.

Original languageEnglish
Title of host publicationComputational Intelligence and Security - International Conference, CIS 2005, Proceedings
PublisherSpringer Verlag
Pages208-215
Number of pages8
ISBN (Print)3540308180, 9783540308188
DOIs
StatePublished - 2005
Externally publishedYes
EventInternational Conference on Computational Intelligence and Security, CIS 2005 - Xi'an, China
Duration: 15 Dec 200519 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3801 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Computational Intelligence and Security, CIS 2005
Country/TerritoryChina
CityXi'an
Period15/12/0519/12/05

Fingerprint

Dive into the research topics of 'Finding optimal addition chains using a genetic algorithm approach'. Together they form a unique fingerprint.

Cite this