z-logo
open-access-imgOpen Access
Hash Algorithm In Verification Of Certificate Data Integrity And Security
Author(s) -
Muhammad Rehan Anwar,
Desy Apriani,
Irsa Rizkita Adianita
Publication year - 2021
Publication title -
aptisi transactions on technopreneurship
Language(s) - English
Resource type - Journals
eISSN - 2656-8888
pISSN - 2655-8807
DOI - 10.34306/att.v3i2.212
Subject(s) - hash function , computer science , cryptographic hash function , sha 2 , security of cryptographic hash functions , secure hash algorithm , hash chain , cryptography , digital signature , hash based message authentication code , cryptographic primitive , data integrity , merkle tree , md5 , message authentication code , password , certificate , theoretical computer science , computer security , cryptographic protocol , double hashing
The hash function is the most important cryptographic primitive function and is an integral part of the blockchain data structure. Hashes are often used in cryptographic protocols, information security applications such as Digital Signatures and message authentication codes (MACs). In the current development of certificate data security, there are 2 (two) types of hashes that are widely applied, namely, MD and SHA. However, when it comes to efficiency, in this study the hash type SHA-256 is used because it can be calculated faster with a better level of security. In the hypothesis, the Merkle-Damgård construction method is also proposed to support data integrity verification. Moreover, a cryptographic hash function is a one-way function that converts input data of arbitrary length and produces output of a fixed length so that it can be used to securely authenticate users without storing passwords locally. Since basically, cryptographic hash functions have many different uses in various situations, this research resulted in the use of hash algorithms in verifying the integrity and authenticity of certificate information.

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