Performance analysis of security algorithms

3Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Computers have become more and more potent over the years, and consequently, it has become more comfortable and easier to break encryption and hashing algorithms. Hence, it is essential to study the performance of these algorithms and analyze them, and possibly come up with better algorithms based on the knowledge we have gained from the analysis. In this paper, a comprehensive literature study of the conventional encryption and hashing algorithms is done, followed by a practical comparison of the time-efficiency and CPU usage of these algorithms, two important performance evaluation parameters.

Cite

CITATION STYLE

APA

Soundararajan, E., Kumar, N., Sivasankar, V., & Rajeswari, S. (2020). Performance analysis of security algorithms. In Lecture Notes in Electrical Engineering (Vol. 656, pp. 465–476). Springer. https://doi.org/10.1007/978-981-15-3992-3_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free