Cryptographic algorithms are the fundamental building blocks of information security systems and their strength generally relies on the concept of computational complexity. But the process of increasing the computational effort needed by an adversary in order to break the provided security has a dramatic impact on the performance of the cryptographic application and sets a severe limit to the proposed security level due to the computational and data intensive operations which require extensive processing power and storage resources. Our solution is to link cryptography to an architecture specially designed to satisfy these demands, namely Grid computing, which has known an increasing popularity in recent years. The wide majority of cryptographic algorithms are designed sequentially and are not ready to embrace the enhancement brought by advances in parallel and distributed computing technologies and hence can not take the plunge to a higher performance level through parallel execution without a proper adjustment process. This paper presents our results on adjusting and implementing several well known cryptographic algorithms on a Grid infrastructure focusing on the achieved performance improvements.
[1]
Ami Marowka,et al.
The GRID: Blueprint for a New Computing Infrastructure
,
2000,
Parallel Distributed Comput. Pract..
[2]
R. Potolea,et al.
A taxonomy for grid applications
,
2008,
2008 IEEE International Conference on Automation, Quality and Testing, Robotics.
[3]
Erwin Laure,et al.
Enabling Grids for e-Science : The EGEE Project
,
2008,
Grid 2008.
[4]
V. Berstis.
Fundamentals of Grid Computing
,
2002
.
[5]
Alfred Menezes,et al.
Handbook of Applied Cryptography
,
2018
.
[6]
Elaine B. Barker,et al.
A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
,
2000
.
[7]
Ian Foster,et al.
The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition
,
1998,
The Grid 2, 2nd Edition.