Chapter

Computational Intelligence and Security

Volume 3801 of the series Lecture Notes in Computer Science pp 208-215

Finding Optimal Addition Chains Using a Genetic Algorithm Approach

  • Nareli Cruz-CortésAffiliated withComputer Science Section, Electrical Engineering Department, Centro de Investigación y de Estudios Avanzados del IPN
  • , Francisco Rodríguez-HenríquezAffiliated withComputer Science Section, Electrical Engineering Department, Centro de Investigación y de Estudios Avanzados del IPN
  • , Raúl Juárez-MoralesAffiliated withComputer Science Section, Electrical Engineering Department, Centro de Investigación y de Estudios Avanzados del IPN
  • , Carlos A. Coello CoelloAffiliated withComputer Science Section, Electrical Engineering Department, Centro de Investigación y de Estudios Avanzados del IPN

* Final gross prices may vary according to local VAT.

Get Access

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.