Parallelization of the data encryption standard(DES) algorithm

Authors:
V. Beletskyy;D. Burak
Affiliations:
Faculty of Computer Science & Information Systems, Technical University of Szczecin, Szczecin, Poland;Faculty of Computer Science & Information Systems, Technical University of Szczecin, Szczecin, Poland
Venue:
Enhanced methods in computer security, biometric and artificial intelligence systems
Year:
2005

Citing 3
Cited 0

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Optimizing compilers for modern architectures: a dependence-based approach

Optimizing compilers for modern architectures: a dependence-based approach
Parallel Processing: From Applications to Systems

Parallel Processing: From Applications to Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the results of parallelizing the Data Encryption Standard (DES) algorithm. The data dependence analysis of the loop iterations was applied in order to parallelize this algorithm. The OpenMP standard is used for presenting a parallel algorithm. The classic DES algorithm can be divided into parallelizable and unparallelizable parts. As a result of our experiments it was stated that most of the "for" loops of the DES algorithm are well suitable for parallelization. The experiments with the parallel part of the algorithm against the sequential one using two- processors machine has shown that the speed-up is about 1.95. However, the rest code, containing I/O functions, is unparallelizable that reduces the speed-up of the parallel program running on multiprocessor computers.