Parallelization of the discrete chaotic block encryption algorithm

  • Authors:
  • Dariusz Burak;Michał Chudzik

  • Affiliations:
  • Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland;Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Poland

  • Venue:
  • PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present the results of parallelizing the Lian et al. discrete chaotic block encryption algorithm. The data dependence analysis of loops was applied in order to parallelize this algorithm. The OpenMP standard is chosen for presenting the parallelism of the algorithm. We show that the algorithm introduced by Lian et al. can be divided into parallelizable and unparallelizable parts. As a result of our study, it was stated that the most timeconsuming loops of the algorithm are suitable for parallelization. The efficiency measurement for a parallel program is presented.