Comparison of Hash Function Algorithms Against Attacks: A Review

2002

Abstract This report gives a survey on cryptographic hash functions. It gives an overview of different types of hash functions and reviews design principles. It also focuses on keyed hash functions and suggests some applications and constructions of keyed hash functions. We have used hash (keyed) function for authenticating messages encrypted using Rijndael [1] block cipher. Moreover, a parallel message digest has been implemented using VHDL.

2010

Recent cryptanalytic attacks have exposed the vulnerabilities of some widely used cryptographic hash functions like MD5 and SHA-1. Attacks in the line of differential attacks have been used to expose the weaknesses of several other hash functions like RIPEMD, HAVAL. In this paper we propose a new efficient hash algorithm that provides a near random hash output and overcomes some of the earlier weaknesses. Extensive simulations and comparisons with some existing hash functions have been done to prove the effectiveness of the BSA, which is an acronym for the name of the 3 authors.

2014

A cryptographic hash function has an important role in cryptography to achieve certain security goals such as authenticity, digital signatures, digital time stamping, and entity authentication. They are also strongly related to other important cryptographic tools such as block ciphers and pseudorandom functions.Due to the previous merits we present a proposal for a new secure hash algorithm based on the combination of some functions of SHA-256 (Secure Hash Algorithm 256)-with its message expansion modification- and MD5 (Message Digest 5) based on double-Davis-Mayer scheme to overcome the weakness existing in these functions. The proposal hash algorithm has been designed to satisfy the different levels of enhanced security and to resist the advanced hash attacks by increasing the complexity degree of the proposed hash algorithm. The security analysis of the proposed hash algorithm is compared to SHA256 and gives more security and highly acceptable results as shown in our security res...

This paper is based on the performance analysis of message digest 5 and secure hashing algorithm. These two topics are related with cryptography and cryptography is an extension of cryptology and cryptanalysis. The purpose of this paper is that to compare the time taken to build a hash as well as it also compares the bit rate passes through a hash value. Here we are going to perform a deep analysis for these two algorithms.

Today, with the development of modern technologies, there is always need to upgrade the existing algorithm or replaces to cope up with the latest requirement. Hash algorithms are the one which are used to ensure the integrity of transmitted or stored data. Many of the algorithms have been designed to generate hash in which some were rejected and some were become standard. MD and SHA family are the most popular standard used to generate hash. The aim of this paper is to compare these standard integrity algorithms and also gives a focus of light on the problems they are currently facing.

2007

Hash functions were introduced in cryptology as a tool to protect the authenticity of information. SHA-1, MD5, and RIPEMD are among the most commonly-used hash function message digest algorithms. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD so the purpose of this paper is combination of some function to reinforce these functions. Recent works have presented collision attacks on SHA-1, MD5 hash functions so the natural response to overcome this threat was assessing the weak points of these protocols that actually depend on collision resistance for their security, and potentially schedule an upgrade to a stronger hash function. Other options involve altering the protocol in some way. This work suggests a different option. We present several simple message pre-processing techniques and show how the techniques can be combined with MD5 or SHA-1 so that applications are no longer vulnerable to the known collision attacks.

International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2022

Cloud is the on-demand availability for data storage management in large-scale companies and even for government sites where the data should be highly confidential. Here, data security plays an equivalent role to data storage. Cloud security is a collection of security measures that are designed to protect cloud-based infrastructure, data, and applications. The level of cloud security differs based on the type of cloud services. Cloud security protects the cloud environment from several attacks like distributed denial of attack, and malware, and prevents unauthorized user access. A crucial component of cloud security in large-scale organizations and for the government is focused on protecting the business contents like customer details, secret design documents, financial records, etc.

2007

A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is known as a hash function. For the last two decades, many types of hash functions have been defined but, the most widely used in many of the cryptographic applications currently are hash functions based on block ciphers and the dedicated hash functions. Almost all the dedicated hash functions are generated using the Merkle-Damgard construction which is developed independently by Merkle and Damgard in 1989 [6, 7]. A hash function is said to be broken if an attacker is able to show that the design of the hash function violates at least one of its claimed security property. There are various types of attacking strategies found on hash functions, such as attacks based on the block ciphers, attacks depending on the algorithm, attacks independent of the algorithm, attacks based on signature schemes, and high level attacks. Besides this, in recent years, many structural weaknesses have been f...

2019

This paper introduces a security analysis scheme for the most famous secure hash algorithms SHA-1 and SHA-2. Both algorithms follow Merkle Damgård structure to compute the corresponding hash function. The randomness of the output hash reflects the strength and security of the generated hash. Therefore, the randomness of the internal rounds of the SHA-1 and SHA-2 hash functions is analyzed using Bayesian and odd ratio tests. Moreover, a proper replacement for both algorithms is proposed, which produces a hash output with more randomness level. The experiments were conducted using a high performance computing testbed and CUDA parallel computing platform.

Message Integrity and authenticity are the primary aim with the ever increasing network protocols' speed. Cryptographic Hash Functions are main building block of message integrity. Many types of hash functions are being used and developed. In this paper, we propose and describe a new keyed hash function. This newly designed function produces a hash code of 128 bits for an arbitrary length input. The function also uses a key during hashing, so any intruder that does not know key, cannot forge the hash code, and, thus it fulfills the purpose of security, authentication and integrity for a message in network. The paper discusses the algorithm for the function design, its security aspects and implementation details.

Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems, 2012

Paper presents a family of parameterized hash functions allowing for flexibility between security and performance. The family consists of three basic hash functions: HaF-256, HaF-512 and HaF-1024 with message digests equal to 256, 512 and 1024 bits, respectively. Details of functions' structure are presented. Method for obtaining function's S-box is described along with the rationale behind it. Security considerations are discussed.

In today's scenario we totally depend on the internet for our everyday tasks. The amount of data transmitted through the internet is growing every day. The need of a hashing algorithm that can guarantee that the integrity and confidentiality of the data is maintained. The aim of the research project is to ensure secure transmission and reception of data with speed and reliability. This model uses the Secure Hash Algorithm (SHA) that creates and appends hashes of the data during transmission. This project aims to discuss the drawbacks and shortcomings of the now used hashing algorithms and come up with enhanced security features along with maintaining speed.

The main purpose of passwords is to prevent unauthorized people from accessing the system. The rise in internet users has led to an increase in password hacking, which has resulted in a variety of problems. These issues include opponents stealing a company's or nation's private information and harming the economy or the organization's security. Password hacking is a common tool used by hackers for illegal purposes. Password security against hackers is essential. There are several ways to hack passwords, including traffic interception, social engineering, credential stuffing, and password spraying. In an attempt to prevent hacking, hashing algorithms are therefore mostly employed to hash passwords, making password cracking more difficult. In the suggested work, several hashing techniques, including message digest (MD5), secure hash algorithms (SHA1, SHA2, and SHA3) have been used. They have become vulnerable as a result of being used to store passwords. A rainbow table attack is conceivable. Passwords produced with different hash algorithms can have their hash values attacked with the help of the Hashcat program. It is proven that the SHA3 algorithm can help with more secure password storage when compared to other algorithms.

1998

Cryptographic hash functions are an important building block for a wide range of applications such as the authentication of information, digital signatures and the protection of pass-phrases. The most popular hash functions are the custom designed iterative hash functions from the MD4 family. Over the years various results on the cryptanalysis of these functions have become available and this paper intends to summarize these results and their impact. We will describe attacks on MD4, MD5 and RIPEMD, and discuss the design and security of the hash functions SHA-1 and RIPEMD-160 which are included in the new standard ISO/IEC 10118-3.

International Journal of Scientific Research in Computer Science Applications and Management Studies, 2018

This Electronic commerce or e-commerce is currently one of the most significant aspects of the Internet to emerge. It covers a range of different types of businesses, Smart cards today perceive epidemic growth as a secure and favourable identification and authentication schemes with various applications like using control system, driving license, Epassports, E-commerce business etc., and the list is expanding. During recent years, cryptographic approaches have been applied to remove these problems. Among these approaches, Dynamic Id protocols have been played a vital role in providing secure communications. ID-based authentication scheme which can reduce all kinds of security flaws. The functionally, performance and security analysis show that current methodology is feasible in terms of computation cost, storage capacity and the scheme can resist server attack.