z-logo
open-access-imgOpen Access
Safer and More Efficient Parallel Cryptographic Algorithm and its Implementation in the GPU
Author(s) -
Artan Berisha
Publication year - 2021
Publication title -
journal of computer science and technology studies
Language(s) - English
Resource type - Journals
ISSN - 2709-104X
DOI - 10.32996/jcsts.2021.3.1.2
Subject(s) - computer science , hash function , cryptography , cryptographic hash function , secure hash algorithm , password , cuda , cryptographic primitive , authentication (law) , message authentication code , hash based message authentication code , digital signature , algorithm , distributed computing , sha 2 , cryptographic protocol , parallel computing , computer network , computer security
In the digital world, the demand for data security during communication has increased. Hash functions are one of the cryptographic algorithms that provide data security in terms of data authenticity and integrity. Nowadays, most online applications require user authentication. These authentications are done on the server-side, which he must manage. As the number of applications increases, building a one-way function will be faster for calculating a hash value for small data such as passwords. In this paper, we will present a sequential cryptographic algorithm and its parallel implementation. We performed security analyses, executed comparisons for different amounts of data, and provided steps for further developing this algorithm. With the construction of this one-way function, we have provided the calculation of hash value in a shorter time for data in small quantities, which speeds up the authentication process on the server and thus speeds up the online services provided by the respective applications. A comparison was made between sequential implementation, parallel implementation on the CPU, and parallel implementation on the GPU using CUDA (Computer Unified Device Architecture) platform.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here