Parallelization of the Discrete Chaotic Block Encryption Algorithm

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 th...

Full description

Saved in:
Bibliographic Details
Published inParallel Processing and Applied Mathematics pp. 323 - 332
Main Authors Burak, Dariusz, Chudzik, Michał
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2012
SeriesLecture Notes in Computer Science
Subjects
chaos-based algorithm
data dependency analysis
encryption
OpenMP
parallelization
Online AccessGet full text
ISBN3642314996
9783642314995
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-31500-8_33

Cover

More Information
Summary: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.
ISBN:3642314996
9783642314995
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-31500-8_33