Abstract
Most cryptography systems are based on the modular exponentiation to perform the non-linear scrambling operation of data. It is performed using successive modular multiplications, which are time consuming for large operands. Accelerating cryptography needs optimising the time consumed by a single modular multiplication and/or reducing the total number of modular multiplications performed. Using a genetic algorithm, we first yield the minimal sequence of powers, generally called addition chain, that need to be computed to finally obtain the modular exponentiation result. Then, we exploit the co-design methodology to engineer a cryptographic device that accelerates the encryption/decryption throughput without requiring considerable hardware area.
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
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)
Blum, T., Paar, C.: Montgomery modular exponentiation on reconfigurable hardware. In: Proceedings of the 14th. IEEE Symposium on Computer Arithmetic, Australia (1999)
Walter, C.D.: Systolic modular multiplication. IEEE Transactions on Computers 42(3), 376–378 (1993)
Nedjah, N., Mourelle, L.M.: Two hardware implementations for the Montgomery multiplication: sequential vs. parallel. In: Proceedings of the 15th. Symposium on Integrated Circuits and Systems Design, Brazil, pp. 3–8. IEEE Computer Society, Los Alamitos (2002)
Nedjah, N., Mourelle, L.M.: Minimal addition chains for efficient modular exponentiation using genetic algorithms. In: Hendtlass, T., Ali, M. (eds.) IEA/AIE 2002. LNCS (LNAI), vol. 2358, pp. 88–98. Springer, Heidelberg (2002)
Balarin, F., et al.: Hardware-software co-design of embedded systems: the polis approach. Kluwer Academic Publishers, Dordrecht (1997)
DeJong, 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)
Haupt, R.L., Haupt, S.E.: Practical genetic algorithms. John Wiley and Sons, Chichester (1998)
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)
Montgomery, P.L.: Modular Multiplication without trial division. Mathematics of Computation 44, 519–521 (1985)
Xess (2003), http://www.xess.com
Intel, MCSTM51 family of micro-controllers architectural overview (2003), http://www.intel.com
Xilinx (2003), http://www.xilinx.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjah, N., de Macedo Mourelle, L. (2004). Evolutionary RSA-Based Cryptographic Hardware Using the Co-Design Methodology. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-24677-0_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22007-7
Online ISBN: 978-3-540-24677-0
eBook Packages: Springer Book Archive