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.Key wordscryptographyData Encryption StandardOpenMP APIdata dependence analysis
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have