Abstract
Modular exponentiation is fundamental to several public-key cryptography systems such as the RSA encryption system. It is performed using successive modular multiplication. The latter operation is time consuming for large operands. Accelerating public-key cryptography software or hardware needs either optimising the time consumed by a single modular multiplication or reducing the total number of modular multiplication performed or both of them. This paper introduces a novel idea based on genetic algorithms for computing an optimal addition chain that allows us to minimise the number of modular multiplication and hence implementing efficiently the modular exponentiation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Erdös, P., Remarks on number theory III: On addition chain, Acta Arithmetica, pp 77–81, 1960.
Haupt, R.L. and Haupt, S.E., Practical genetic algorithms, John Wiley and Sons, New York, 1998.
Knuth, D.E., The Art of Programming: Seminumerical Algorithms, vol. 2. Reading, MA: AddisonWesley, Second edition, 1981.
Koç, C.K., High-speed RSA Implementation, Technical report, RSA Laboratories, Redwood City, califirnia, USA, November 1994.
Kunihiro, N. and Yamamoto, H., New methods for generating short addition chain, IEICE Transactions, vol. E83-A, no. 1, pp. 60–67, January 2000.
Michalewics, Z., Genetic algorithms + data structures = evolution program, Springer-Verlag, USA, third edition, 1996.
Neves, J., Rocha, M., Rodrigues, Biscaia, M. and Alves, J., Adaptive strategies and the design evolutionary applications, Proceedings of the Genetic and the Design of Evolutionary Computation Conference, Orlando, Florida, USA, 1999.
Rivest, R.L., Shamir, A. and Adleman, L., A method for obtaining digital signature and public-key cryptosystems, Communication of ACM, vol. 21, no. 2, pp. 120–126, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjah, N., de Macedo Mourelle, L. (2002). Minimal Addition Chain for Efficient Modular Exponentiation Using Genetic Algorithms. In: Hendtlass, T., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2002. Lecture Notes in Computer Science(), vol 2358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48035-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-48035-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43781-9
Online ISBN: 978-3-540-48035-8
eBook Packages: Springer Book Archive