Advertisement

Minimal Addition-Subtraction Sequences for Efficient Pre-processing in Large Window-Based Modular Exponentiation Using Genetic Algorithms

  • Nadia Nedjah
  • Luiza de Macedo Mourelle
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2690)

Abstract

This paper introduces a novel application of genetic algorithms for evolving optimal addition-subtraction sequences that allow one to perform pre- computations necessary in the window-based modular exponentiation methods. When the window size is large, the pre-processing step becomes very expensive. Evolved addition/addition-subtraction sequences are of minimal size so they allow one to perform exponentiation with a minimal number of multiplication and/or divisions and hence implementing efficiently the exponentiation operation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Begeron, R., Berstel, J., Brlek, S., Duboc, C.: Addition chains using continued fractions. Journal of Algorithms 10, 403–412 (1989)CrossRefMathSciNetGoogle Scholar
  2. 2.
    De Jong, K., 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, Heidelberg (1990)Google Scholar
  3. 3.
    De Jong, K., Spears, W.M.: Using genetic algorithms to solve NP-complete problems. In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 124–132. Morgan Kaufmann, San Francisco (1989)Google Scholar
  4. 4.
    Erdös, P.: Remarks on number theory III: On addition chain. Acta Arithmetica, 77–81 (1960)Google Scholar
  5. 5.
    Haupt, R.L., Haupt, S.E.: Practical genetic algorithms. John Wiley and Sons, New York (1998)zbMATHGoogle Scholar
  6. 6.
    Knuth, D.E.: The Art of Programming: Seminumerical Algorithms, 2nd edn., vol. 2. Addison_Wesley, Reading (1981)zbMATHGoogle Scholar
  7. 7.
    Koç, Ç.K., High-speed, R.S.A.: Implementation, Technical report, RSA Laboratories, Redwood City, califirnia, USA (November 1994)Google Scholar
  8. 8.
    Kunihiro, N., Yamamoto, H.: New methods for generating short addition chain. IEICE Transactions E83-A, 60–67 (2000)Google Scholar
  9. 9.
    Michalewics, Z.: Genetic algorithms + data structures = evolution program, 3rd edn. Springer, USA (1996)Google Scholar
  10. 10.
    Menezes, A.J.: Elliptic curve public key cryptosystems. Kluwer Academic, Dordrecht (1993)zbMATHGoogle Scholar
  11. 11.
    Neves, J., Rocha, M., Rodrigues, B.M., Alves, J.: Adaptive strategies and the design evolutionary applications. In: Proceedings of the Genetic and the Design of Evolutionary Computation Conference, Orlando, Florida, USA (1999)Google Scholar
  12. 12.
    Nedjah, N., Mourelle, L.M.: Minimal addition chains using genetic algorithms. In: Proceedings of the Fifteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Cairns, Australia. LNCS, Springer, Heidelberg (2002) (to appear)Google Scholar
  13. 13.
    Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signature and public-key cryptosystems. Communication of ACM 21(2), 120–126 (1978)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nadia Nedjah
    • 1
  • Luiza de Macedo Mourelle
    • 1
  1. 1.Department of Systems Engineering and Computation, Faculty of EngineeringState University of Rio de JaneiroBrazil

Personalised recommendations