GridCrypt: high performance symmetric key cryptography using enterprise grids

  • Authors:
  • Agus Setiawan;David Adiutama;Julius Liman;Akshay Luther;Rajkumar Buyya

  • Affiliations:
  • Grid Computing and Distributed Systems Laboratory, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia;Grid Computing and Distributed Systems Laboratory, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia;Grid Computing and Distributed Systems Laboratory, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia;Grid Computing and Distributed Systems Laboratory, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia;Grid Computing and Distributed Systems Laboratory, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia

  • Venue:
  • PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Today’s cryptanalysis on symmetric key cryptography is encouraging the use of larger key sizes and complex algorithms to achieve an unbreakable state. However, this leads an increase in computational complexity. This has promoted many researchers to develop high-performance symmetric key cryptography schemes using approaches such as the use of high-end computing hardware. Peer-to-peer (P2P) or enterprise grids are proven as one of the approaches for developing cost-effective high-end computing systems. By utilizing them, one can improve the performance of symmetric key cryptography through parallel execution. This approach makes it attractive for adoption by businesses to secure their documents. In this paper we propose and develop an application for symmetric key cryptography using enterprise grid middleware called Alchemi. An analysis and comparison of its performance is presented along with pointers to future work.