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.

/pdf/comparison-of-hash-function-algorithms-against-attacks-a-24jxbjc2oh.pdf

Comparison of hash function algorithms against attacks: A review

Blockchain technology appears to be the ideal solution for storing data in a transparent and decentralized manner. It also allows open access to data and enhances its immutable nature. This technology has helped prove its usefulness in several industries so far, however, distributed ledger technology does not work as a pure database. Therefore, some problems occur in accessing data. Querying data in the blockchain leads to performance and bandwidth problems. This primarily occurs because the blockchain does not have a primary query language, unlike regular databases. The distributed nature of the blockchain is in this case an obstacle. In this paper, a safe and fast method will be proposed to retrieve consistent data from the blockchain-based on the smart contract that will be opened after completing the transaction procedures. All nodes will sign the proposed transaction (by adding a special hash to each node resulting from the transaction information and node data). Upon completion of Transaction procedures, A smart contract will be opened (in which a QR is placed) resulting from converting the signatures in the transaction to QR When the smart contract data is retrieved, the QR for each transaction will be used All node signatures and transaction data will be extracted. The data will be retrieved by the QR generated for each transaction after it is stored in all nodes servers participating in the system. A new method was proposed to generate a hash for each node present in the system. The proposed method was tested in terms of time and complexity, and the algorithm was statistically analyzed, and all the results proved successful.

/pdf/data-retrieval-based-on-the-smart-contract-within-the-8otn1s52hg.pdf

Data retrieval based on the smart contract within the blockchain

Blockchain technology introduces a new approach to storing information, implementing tasks and functions, and building trust between participating nodes. Although blockchain technology has received extensive attention in various application contexts in recent years, the issue of privacy and security remains the primary focus of discussions of the blockchain. The use of hash algorithms can provide secure blockchain integration, and many hash algorithms offer solutions to data integrity and security problems within the context of blockchain technology. However, they are also subject to problems related to time, lack of resources, and memory usage. In this research, an algorithm is proposed to generate a hash based on chaos theory (1D and 2D) logistic maps and the new Merkle-Damgard construction. Hash outputs are tested in terms of time, complexity, and collision. The proposed algorithm is evaluated according to Jaccard similarity and various coefficient measurements, and it was found that the similarity between the inputs and the outputs does not exceed 0.1932 percent. All outcomes indicated successful performance. The proposed algorithm was implemented on a blockchain-based transaction flow system, consumed fewer resources than other hash algorithms (such as SHA1, SHA2, and MD5), and requires mere milliseconds to implement.

/pdf/a-proposed-hash-algorithm-to-use-for-blockchain-base-1jlxke9r3s.pdf

A Proposed hash algorithm to use for blockchain base transaction flow system

MD5 Message Digest Algorithm License - Version 1.0

In cryptography, hash functions have very important effects when it’s used in the message integrity, digital time stamping, and digital signature. Hash functions compute hash value by a set of logical (primitive) operations that perform on a (32) bit words for authentication. Authentication process becomes very important especially manipulated message undetected that can have disastrous effects in Network Management and E-Commerce. In this paper, a proposal for new hash function based on MD5 is developed. The length of message digest is 224-bit through (4) rounds that each round has a pair of (16) steps. The final number of steps is (128) that make stronger function against collision attests and more secure than MD5.

https://anjs.edu.iq/index.php/anjs/article/download/220/177

Hasanen S. Abdulah

Papers

Message Authentication Using New Hash Function

Argumentation Frameworks - A Brief Review