Abstract
Modular exponentiation is the main operation to RSA-based 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 multiplications required. Existing methods attempt to reduce this number by partitioning the exponent in constant or variable size windows. However, these window-based methods require some pre-computations, which themselves consist of modular exponentiations. It is clear that pre-processing needs to be performed efficiently also. In this paper, we exploit the ant colony strategy to finding an optimal addition sequence that allows one to perform the pre-computations in window-based methods with a minimal number of modular multiplications. Hence we improve the efficiency of modular exponentiation. We compare the yielded addition sequences with those obtained using Brun’s algorithm.
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
Dorigo, M., Gambardella, L.M.: Ant Colony: a Cooperative Learning Approach to the Travelling Salesman Problem. IEEE Transaction on Evolutionary Computation 1(1), 53–66 (1997)
Downing, P., Leong, B., Sthi, R.: Computing Sequences with Addition Chains. SIAM Journal on Computing 10(3), 638–646 (1981)
Feber, J.: Multi-Agent Systems: an Introduction to Distributed Artificial Intelligence. Addison-Wesley, Reading (1995)
Nedjah, N., Mourelle, L.M.: Efficient Parallel Modular Exponentiation Algorithm. In: Yakhno, T. (ed.) ADVIS 2002. LNCS, vol. 2457, pp. 405–414. Springer, Heidelberg (2002)
Nedjah, N., Mourelle, L.M.: Minimal addition-subtraction chains using genetic algorithms. In: Yakhno, T. (ed.) ADVIS 2002. LNCS, vol. 2457, pp. 303–313. Springer, Heidelberg (2002)
Nedjah, N., de Macedo Mourelle, L.: Minimal addition-subtraction chains with ant colony. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 1082–1087. Springer, Heidelberg (2004)
Rivest, R., Shamir, A., Adleman, L.: A method for Obtaining Digital Signature and Public-Key Cryptosystems. Communications of the ACM 21, 120–126 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjah, N., de Macedo Mourelle, L. (2005). Efficient Pre-processing for Large Window-Based Modular Exponentiation Using Ant Colony. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554028_89
Download citation
DOI: https://doi.org/10.1007/11554028_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28897-8
Online ISBN: 978-3-540-31997-9
eBook Packages: Computer ScienceComputer Science (R0)