EMPLOYING MULTI-CORE PROCESSOR ARCHITECTURES TO ACCELERATE JAVA CRYPTOGRAPHY EXTENSIONS

Mario Ivkovic, Thomas Zefferer

2011

Abstract

For many years, the increase of clock frequencies has been the preferred approach to raise computational power. Due to physical limitations and cost-effectiveness reasons, hardware vendors were forced to change their strategy. Instead of increasing clock frequencies, processors are nowadays supplied with a growing number of independent cores to increase the overall computational power. This major paradigm shift needs to be considered in software design processes as well. Software needs to be parallelized to exploit the full computing power provided by multi-core architectures. Due to their intrinsic computational complexity, cryptographic algorithms require efficient implementations. On multi-core architectures this comprises the need for parallelism and concurrent execution. To meet this challenge, we have enhanced an existing JavaTM based cryptographic library by parallelizing a subset of its algorithms. Made measurements have shown speed-ups from 1.35 up to 1.78 resulting from the applied modifications. In this paper we show that regardless of their complexity, several cryptographic algorithms can be parallelized to a certain extent with reasonable effort. The applied parallelization of the JavaTM based cryptographic library has significantly enhanced its performance on multi-core architectures and has therefore made a valuable contribution to its sustainability.

References

  1. Bridges, M. J., Vachharajani, N., Zhang, Y., Jablin, T., and August, D. I. (2008). Revisiting the sequential programming model for the multicore era. Micro, IEEE, 28(1):12-20.
  2. Daemen, J. and Rijmen, V. (2002). The Design of Rijndael. Springer-Verlag New York, Inc., Secaucus, NJ, USA.
  3. Dig, D., Marrero, J., and Ernst, M. D. (2009). Refactoring sequential java code for concurrency via concurrent libraries. In ICSE 7809: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering, pages 397-407, Washington, DC, USA. IEEE Computer Society.
  4. Freisleben, B. and Kielmann, T. (1995). Automated transformation of sequential divide-and-conquer algorithms into parallel programs. Computers and Artificial Intelligence, 14:579-596.
  5. Lea, D. (2005). The java.util.concurrent synchronizer framework. Sci. Comput. Program., 58(3):293-309.
  6. Peierls, T., Goetz, B., Bloch, J., Bowbeer, J., Lea, D., and Holmes, D. (2005). Java Concurrency in Practice. Addison-Wesley Professional.
  7. Rugina, R. and Rinard, M. (1999). Automatic parallelization of divide and conquer algorithms. In PPoPP 7899: Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 72-83, New York, NY, USA. ACM.
  8. Silverman, R. D. (1997). Fast generation of random, strong rsa primes. CryptoBytes, 3(1):9-13.
  9. Sutter, H. (2005). The free lunch is over: A fundamental turn toward concurrency in software. http://www.gotw.ca/publications/concurrencyddj.htm.
Download


Paper Citation


in Harvard Style

Ivkovic M. and Zefferer T. (2011). EMPLOYING MULTI-CORE PROCESSOR ARCHITECTURES TO ACCELERATE JAVA CRYPTOGRAPHY EXTENSIONS . In Proceedings of the 7th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8425-51-5, pages 5-12. DOI: 10.5220/0003339000050012


in Bibtex Style

@conference{webist11,
author={Mario Ivkovic and Thomas Zefferer},
title={EMPLOYING MULTI-CORE PROCESSOR ARCHITECTURES TO ACCELERATE JAVA CRYPTOGRAPHY EXTENSIONS},
booktitle={Proceedings of the 7th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2011},
pages={5-12},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003339000050012},
isbn={978-989-8425-51-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - EMPLOYING MULTI-CORE PROCESSOR ARCHITECTURES TO ACCELERATE JAVA CRYPTOGRAPHY EXTENSIONS
SN - 978-989-8425-51-5
AU - Ivkovic M.
AU - Zefferer T.
PY - 2011
SP - 5
EP - 12
DO - 10.5220/0003339000050012