Abstract
Modular exponentiation is a cornerstone operation to several public-key cryptosystems. It is performed using successive modular multiplications. This operation is time consuming for large operands, which is always the case in cryptography. For software or hardware fast cryptosystems, one needs thus reducing the total number of modular multiplication required. Existing methods attempt to reduce this number by partitioning the exponent in constant or variable size windows. However, these window methods require some precomputations, which themselves consist of modular exponentiations. In this paper, we exploit genetic algorithms to evolving an optimal addition sequence that allows one to perform the pre-computations in window methods with a minimal number of modular multiplications. Hence we improve the efficiency of modular exponentiation. We compare the evolved addition sequences with those obtained using Brun’s algorithm.
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
Begeron, R. Berstel, J, Brlek, S. and Duboc, C., Addition chains using continued fractions, Journal of Algorithms, no. 10, pp. 403–412, 1989.
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.
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: Addison_Wesley, Second edition, 1981.
Koç, Ç.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.
Menezes, A.J., Elliptic curve public key cryptosystems, Kluwer Academic, 1993.
Nedjah, N. and Mourelle, L.M., Minimal addition chains using genetic algorithms, Proceedings of the Fifteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Cairns, Australia, (to appear in Lecture Notes in Computer Science, Springer-Verlag), 2002.
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
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjah, N., Mourelle, L.d.M. (2003). Efficient Pre-processing for Large Window-Based Modular Exponentiation Using Genetic Algorithms. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_63
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive