IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v24y2018i3d10.1007_s10732-017-9340-2.html
   My bibliography  Save this article

Finding short and implementation-friendly addition chains with evolutionary algorithms

Author

Listed:
  • Stjepan Picek

    (KU Leuven, ESAT/COSIC and Imec
    Massachusetts Institute of Technology)

  • Carlos A. Coello Coello

    (CINVESTAV-IPN)

  • Domagoj Jakobovic

    (University of Zagreb)

  • Nele Mentens

    (KU Leuven, ESAT/COSIC and Imec)

Abstract

Finding the shortest addition chain for a given exponent is a significant problem in cryptography. In this work, we present a genetic algorithm with a novel encoding of solutions and new crossover and mutation operators to minimize the length of the addition chains corresponding to a given exponent. We also develop a repair strategy that significantly enhances the performance of our approach. The results are compared with respect to those generated by other metaheuristics for exponents of moderate size, but we also investigate values up to $$2^{255} - 21$$ 2 255 - 21 . For numbers of such size, we were unable to find any results produced by other metaheuristics which could be used for comparison purposes. Therefore, we decided to add three additional strategies to serve as benchmarks. Our results indicate that the proposed approach is a very promising alternative to deal with this problem. We also consider a more practical perspective by taking into account the implementation cost of the chains: we optimize the addition chains with regards to the type of operations as well as the number of instructions required for the implementation.

Suggested Citation

  • Stjepan Picek & Carlos A. Coello Coello & Domagoj Jakobovic & Nele Mentens, 2018. "Finding short and implementation-friendly addition chains with evolutionary algorithms," Journal of Heuristics, Springer, vol. 24(3), pages 457-481, June.
    • Handle: RePEc:spr:joheur:v:24:y:2018:i:3:d:10.1007_s10732-017-9340-2
    DOI: 10.1007/s10732-017-9340-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9340-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-017-9340-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:24:y:2018:i:3:d:10.1007_s10732-017-9340-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.