Performance and Limitation Review of Secure Hash Function Algorithm

Main Article Content

Iti Malviya
Tejasvini Chetty

Abstract

A cryptographic hash work is a phenomenal class of hash work that has certain properties which make it fitting for use in cryptography. It is a numerical figuring that maps information of emotional size to a bit string of a settled size (a hash) and is expected to be a confined limit, that is, a limit which is infeasible to adjust. Hash Functions are significant instrument in information security over the web. The hash functions that are utilized in different security related applications are called cryptographic hash functions. This property is additionally valuable in numerous different applications, for example, production of digital signature and arbitrary number age and so on. The vast majority of the hash functions depend on Merkle-Damgard development, for example, MD-2, MD-4, MD-5, SHA-1, SHA-2, SHA-3 and so on, which are not hundred percent safe from assaults. The paper talks about a portion of the secure hash function, that are conceivable on this development, and accordingly on these hash functions additionally face same attacks.

Article Details

How to Cite
Malviya, I., and T. Chetty. “Performance and Limitation Review of Secure Hash Function Algorithm”. International Journal on Recent and Innovation Trends in Computing and Communication, vol. 7, no. 6, June 2019, pp. 48-51, doi:10.17762/ijritcc.v7i6.5323.
Section
Articles