Treffer: Evaluation of Digital Signatures Using RSA and HMAC Algorithms.
Weitere Informationen
Nowadays, communication can be conducted at high speed and conveniently through computer networks. In addition, devices in network systems can store data for extended periods. However, communication or storage over the network may lead to security issues or loss of data integrity. Therefore, data security mechanisms should be used to verify and maintain confidentiality and integrity. This research aims to evaluate which algorithm can verify data integrity and identify message authors in the least amount of time. The algorithms studied are Rivest–Shamir–Adleman (RSA), Hash-based Message Authentication Code–Secure Hash Algorithm 256 (HMAC-SHA256), HMAC-SHA384, and HMAC-SHA512, all of which verify data integrity and authenticate message authors. We compared the performance of all algorithms using ten different data sizes ranging from 100 to 1000 MB, with twenty datasets for each size, and evaluated their throughput and bandwidth. The results show that the HMAC-SHA256 algorithm requires the least execution time and therefore demonstrates the highest efficiency. In addition, the algorithm becomes more efficient as the data size increases, followed by HMAC-SHA512, HMAC-SHA384, and RSA, respectively. In future work, studying other algorithms that are capable of verifying data integrity and sender authenticity, such as digital signatures using RSA, Elliptic Curve Cryptography (ECC), and Galois Message Authentication Code (GMAC), or developing applications using HMAC-SHA256 for data integrity and sender authentication, will provide further insights into selecting the most appropriate algorithm for specific applications. [ABSTRACT FROM AUTHOR]
Copyright of Engineering, Technology & Applied Science Research is the property of Engineering, Technology & Applied Science Research and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)