Comparing the speed of the selected hash and encryption algorithms
Dawid Górniak
dawid.gorniak@pollub.edu.plInstitute of Computer Science, Lublin University of Technology, Nadbystrzycka 36B, 20-618 Lublin, Poland (Poland)
Piotr Kopniak
Institute of Computer Science, Lublin University of Technology, Nadbystrzycka 36B, 20-618 Lublin, Poland (Poland)
Abstract
The data is often the most valuable thing that we collect on our computers. Without proper data security with encryption our valuable information may be illegally used by an unauthorised person. The article presents selected encryption methods and hash functions available in Boucy Castle library for Java programming language. The presented analysis applies to measurement of the speed of signature generation and verification. The signatures are for 240 bit encryption algorithms. In case of a hash function, the analysis refers to the speed of such functions. The fastest encryption algorithm and hash function from the research group were AES and SHA1.
Keywords:
encryption algorithms; hash functions; Bouncy CastleReferences
[2] Kryptografia i bezpieczeństwo sieci komputerowych, Helion, 2012.
[3] Marcin Karbowski, Podstawy kryptografii RSA. Wydanie III, Helion, 2014.
[4] A. Menezes, Kryptografia stosowana, WTN, 2005.
[5] Serpent, www.pl.wikipedia.org/wiki/Serpent_(kryptografia)
[6] Twofish , www.pl.wikipedia.org/wiki/Twofish.
[7] I. Damgard, A design principle for hash functions, SpringerVerlag, 1990.
[8] MD5, www.pl.wikipedia.org/wiki/MD5
[9] M. Jakobsson, Applied Cryptography and Network Security, Springer Verlag gmbh, 2014.
Authors
Dawid Górniakdawid.gorniak@pollub.edu.pl
Institute of Computer Science, Lublin University of Technology, Nadbystrzycka 36B, 20-618 Lublin, Poland Poland
Authors
Piotr KopniakInstitute of Computer Science, Lublin University of Technology, Nadbystrzycka 36B, 20-618 Lublin, Poland Poland
Statistics
Abstract views: 313PDF downloads: 19
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
