Skip to main content
SpringerLink
Log in

Minimal Addition-Subtraction Chains Using Genetic Algorithms

  • Conference paper
  • First Online:
Book cover Advances in Information Systems (ADVIS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2457))

Included in the following conference series:

Abstract

Addition and addition-subtraction chains consist of a sequence of integers that allow one to efficiently compute power T E, where T varies but E is constant. The shorter the addition (addition-subtraction) chain is, the more efficient the computation. Solving the optimisation problem that yields the shortest addition (addition-subtraction) is NP-hard. There exists some heuristics that attempt to obtain reduced addition (addition-subtraction) chains. We obtain minimal addition (addition-subtraction) chains using genetic algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. DeJong, K. and Spears, W.M., An analysis of the interacting roles of the population size and crossover type in genetic algorithms, In Parallel problem solving from nature, pp. 38–47, Springer-Verlag, 1990.

    Google Scholar 

  2. DeJong, K. and Spears, W.M., Using genetic algorithms to solve NP-complete problems, Proceedings of the Third International Conference on Genetic Algorithms, pp. 124–132, Morgan Kaufmann, 1989.

    Google Scholar 

  3. Erdös, P., Remarks on number theory III: On addition chain, Acta Arithmetica, pp 77–81, 1960.

    Google Scholar 

  4. Gordon, D.M., A survey of fast exponentiation methods, technical report

    Google Scholar 

  5. Haupt, R.L. and Haupt, S.E., Practical genetic algorithms, John Wiley and Sons, New York, 1998.

    MATH  Google Scholar 

  6. Knuth, D.E., The Art of Programming: Seminumerical Algorithms, vol. 2. Reading, MA: Addison_Wesley, Second edition, 1981.

    MATH  Google Scholar 

  7. Koç, Ç.K., High-speed RSA Implementation, Technical report, RSA Laboratories, Redwood City, califirnia, USA, November 1994.

    Google Scholar 

  8. Kunihiro, N. and Yamamoto, H., New methods for generating short addition chain, IEICE Transactions, vol. E83-A, no. 1, pp. 60–67, January 2000.

    Google Scholar 

  9. Michalewics, Z., Genetic algorithms + data structures = evolution program, Springer-Verlag, USA, third edition, 1996.

    Google Scholar 

  10. F. Miller, Use of elliptic curves in cryptography, Advances in Cryptology—Crypto’ 85, Lecture Notes in Computer Science 218, Springer-Verlag, pp. 417–426, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Rio de Janeiro, Brazil

    Nadia Nedjah & Luiza de Macedo Mourelle

Authors
  1. Nadia Nedjah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luiza de Macedo Mourelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Engineering Department, Dokuz Eylul University, 35100, Izmir, Bornova, Turkey

    Tatyana Yakhno

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nedjah, N., de Macedo Mourelle, L. (2002). Minimal Addition-Subtraction Chains Using Genetic Algorithms. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-36077-8_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00009-9

  • Online ISBN: 978-3-540-36077-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation