Improving Security Through Hashing

International journal of engineering research and technology, 2020

Data transition over the internet has become inevitable. Most data transmitted in the form of multimedia. The data transmission must be less complex and user friendly at the same time with more security. Message authentication and integrity is one of the major issues in security data Transmission. There are plenty of methods used to ensure the integrity of data when it is send from the receiver and before it reaches the corresponding receiver. If these messages are tampered in the midst, it should be intimated to the receiver and discarded. Hash algorithms are supposed to provide the integrity but almost all the algorithms have confirmed breakable or less secure. In this review, the performances of various hash functions are studied with an analysis from the point of view of various researchers.

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.

African Journal of Business Management, 2011

Hashing is a process of transforming a variable length data message into a fixed size message digest. Hashing algorithms are considered one-way functions, since the input cannot be determined from the message digests. As a security tool in data communication, hashing is used both for protecting data integrity and for authentication. This study introduces a newly developed hash function. In hashing function, the most important features required are that the function must hash a message of any size, a message with a fixed size, and minor changes formed in hashed message must also change the hash. Effects of possible deformations in the hash message will subsequently be discussed through some tests.

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.

2016

In today’s information-based society, encryption along with the techniques for authentication and integrity are key to the security of information. Cryptographic hashing algorithms, such as the Secure Hashing Algorithms (SHA), are an integral part of the solution to the information security problem. This paper presents the state of art hashing algorithms including the security challenges for these hashing algorithms. It also covers the latest research on parallel implementations of these cryptographic algorithms. We present an analysis of serial and parallel implementations of these algorithms, both in hardware and in software, including an analysis of the performance and the level of protection offered against attacks on the algorithms.

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.

2021

Due to the rapid development of internet technologies, voluminous data is generated every minute from multifarious sources. Therefore, it becomes arduous for traditional tools to analyse and process such a huge amount of data. Cryptographic hashing is one of the best techniques to cope with big data in an effective way. It also plays a pivotal role in protecting integrity of message while in transmission. In this paper, a novel one-way cryptographic hashing algorithm has been proposed, this produces a digest of size 128 bits for any length of a message. This paper provides implementation results of basic properties of the hashing algorithm and these results prove that proposed algorithm is better than the existing ones in terms of execution time and security.

Hash functions are considered key components of nearly all cryptographic protocols, as well as of many security applications such as message authentication codes, data integrity, password storage, and random number generation. Many hash function algorithms have been proposed in order to ensure authentication and integrity of the data, including MD5, SHA-1, SHA-2, SHA-3 and RIPEMD. This paper involves an overview of these standard algorithms, and also provides a focus on their limitations against common attacks. These study shows that these standard hash function algorithms suffer collision attacks and time inefficiency. Other types of hash functions are also highlighted in comparison with the standard hash function algorithm in performing the resistance against common attacks. It shows that these algorithms are still weak to resist against collision attacks.

INTЕRNАTIОNАL RЕSЕАRCH JОURNАL ОF TЕCHNОLОGY АND АPPLIЕD SCIЕNCЕ, 2020

Internet based secure data transmission is an emerging area of research, where most of the data transfer infrastructure is moving to make their service and delivery more efficient.In this Dissertation our work approach lead behind the secure data transmission data get upload over the data server and its different user due to different ownership. The concept behind the research is taken a secure and reliable algorithm, approach which can find the solution for data security redundancy optimization over the data store.The proposedmethod discussed about the file level distribution and redundancy detection using file level chunking, where as to transmit and store the data AES (Asymmetric encryption system) algorithm is used to provide data security. For improvement of the hash calculation use SHA-512, with the help of SHA-2 obtain secure file detection faster as compare to other methods. The proposed research work shows better result as compare to other previous encryption methods in terms of block size, word size, hash output,rounds and time complexity.

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.

International Journal of Advanced Research in Computer Science, 2020

The term hash function has been used in computer science from quite some time and it refers to a function that compresses a string of arbitrary input to a string of fixed length. Cryptographic hash functions are one of the most important tools in the field of cryptography and are used to achieve a number of security goals like authenticity, digital signatures, pseudo number generation, digital steganography, digital time stamping etc. For the past few decades cryptographic hash function become the centre of attention in the cryptographic community. The security of hash function became an important topic as almost every day the world of hash function is facing a new attack. The present paper provides an extensive study on cryptographic hash functions with their applications, properties and detailed classification and also presents a detailed description of cryptographic hash algorithms. It also discusses a general classification of all kinds of possible attacks on hash function analyses some attacks on specific hash functions.

cerc.wvu.edu

Hash functions have numerous applications in cryptography, from public key to cryptographic protocols and cryptosystems. Evidently, substantial effort was invested on designing "secure" hash functions, unintentionally overlooking other engineering aspects that may affect their use in practice. However, we argue that in some applications, the efficiency of hash functions is as important as their security. Unlike most of the existing related works in the literature (which merely report on efficiency figures of some popular hash functions without discussing how and why these results were obtained), we not only discuss how to carry out efficiency evaluations, we also provide a set of optimization guidelines to assist implementers in optimizing their implementations. We demonstrate this by adopting an existing SHA-1/SHA-2 implementation and show how minor optimization can lead to significant efficiency improvements.

Abstract: The message digest algorithm is a widely used cryptographic hash function. It produces a 128-bit hash value. It has been used in a variety of security applications and is also commonly used to check data integrity. However MD5 has been found not to be collision resistant. It is possible to find a pseudo-collision, that is, two different initialization vectors which produce an identical digest. Other attacks that have been found to be working on MD5 are rainbow, dictionary and brute-forcing attacks. The ability to find collisions has been greatly aided by the graphics processing unit (GPU). The solution to these collisions is a robust MD5 compression function. This research paper focused on enhancing the Merkle Damgard model construction, which is the core component of the hashing process. It involved adding an extra iteration so that instead of the current two -cycle looping, we have a three-cycle looping per message block. The aim is to make it computationally infeasible to reverse the hash function. In this way, make the whole MD5 algorithm would be made stronger. This algorithm could then be used for password hashing in an effort to make them robust. The new password hashing mechanism find applications in areas such as digital signatures and digital certificates. Keywords: Hashing, MD5, GPU, Architecture, MITM

International Journal of Computer Applications, 2013

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.