The influence of the parallel programming on the performance of cryptographic algorithms


Abstract

Paper compares possibility to parallelize two cryptographic algorithms: Xor cipher and MD5 collision search. Presented solutions allows user to specify number of used processors. Performance of algorithms where tested on a different types of processors and visualized on graphs.


Keywords

programming; parallel; asynchronous; cryptography

[1] Stallings W.: Kryptografia i bezpieczeństwo sieci komputerowych. Matematyka szyfrów i techniki kryptologii, Helion, Gliwice 2011
[2] Karbowski M.: Podstawy kryptografii. Wydanie III, Helion, Data wydania ebooka: 2015-01-08
[3] Warczak M., Matulewski J., Pawłaszek R.: Programowanie równoległe i asynchroniczne w C# 5.0, Helion, Gliwice 2013
[4] Lee Wei-Meng: 2008. Warsztat programisty C#, Wrox
[5] Alex Davies: Async in C#,O'Reilly Media,2012
[6] Stephen Cleary: Concurrency in C# Cookbook, O'Reilly Media,2014
[7] Numerics in the .NET Framework, [20.04.2016] https://msdn.microsoft.com/enus/library/dn879696(v=vs.110).aspx

Published : 2016-12-30


Kraska, M., & Kozieł, P. (2016). The influence of the parallel programming on the performance of cryptographic algorithms . Journal of Computer Sciences Institute, 2, 120-126. https://doi.org/10.35784/jcsi.127

Mateusz Kraska 
Lublin University of Technology  Poland
Piotr Kozieł  Piotr.koziel@pollub.edu.pl
Lublin University of Technology  Poland