Existing Hash Functions Research Articles

국내·국제 해시함수에 대한 양자회로 구현 비교 분석

The advent of quantum computers threatens the security of existing hash functions. In this paper, we confirmed the implementation results of quantum circuits for domestic/international hash functions, LSH, SHA2, SHA3 and SM3, and conducted a comparative analysis. To operate the existing hash function in a quantum computer, it must be implemented as a quantum circuit, and the quantum security strength can be confirmed by estimating the necessary quantum resources. We compared methods of quantum circuit implementation and results of quantum resource estimation in various aspects and discussed ways to meet quantum computer security in the future.

An Efficient Message Authentication Code Based on Modified MD5-384 Bits Hash Function and Quasigroup

Cryptographic hash functions and HMACs are used to achieve various security goals such as message integrity, message authentication, digital signatures, and entity authentication. This article proposes (1) a new hash function (QGMD5-384) and (2) an efficient message authentication code (QGMAC-384) based on a quasigroup. A quasigroup is a non-associative algebraic structure and its number grows exponentially with its order. Note that the existing hash functions and HMACs that use quasigroups are vulnerable to prefix and suffix attacks. The security of the proposed hash function is analyzed by comparing it with the MD5 and SHA-384. It is found that the proposed QGMD5-384 is more secure. Also, QGMAC-384 is analyzed against brute force and forgery attacks and it is found to be resistant to these attacks. The performance of the new schemes is compared with their counterparts, such as SHA-384 and HMAC-SHA-384. It is observed that QGMD5-384 and QGMAC-384 are slightly slower than MD5 and HMAC-MD5, respectively, but faster than both the SHA-384 and the HMAC-SHA-384.

Analisa Dan Perbandingan Algoritma Whirpool Dan Sha-512 Dalam Penyandian Data Gambar

Image file is a form of collaboration which is located between points, lines, fields and also colors which will be very useful for imaging something, digital images are representations of light intensity functions in discrete form on a two-dimensional plane. An image file can be said to be original or original if the image does not experience the slightest change in any structure of an image. Manipulation of a file often occurs and is carried out by irresponsible people to provide benefits for that person, it is necessary to have a technique used to maintain the originality of a file or detect the authenticity of the image file, a technique can be used, namely Cryptography techniques. Cryptography is a science that studies how to keep data or messages safe when sent, from sender to recipient without experiencing any interference from irresponsible parties. A hash function is a one-way function that converts a set of strings into a set of strings whose size is smaller than the original size. The hash function has many uses, such as to maintain data integrity, delivery time efficiency, and to minimize the length of diverse data. The real-world applications of hash functions vary, such as being used to check the originality of data, to store keywords in databases, and much more. In this study, 2 existing hash functions will be discussed, namely the SHA-512 hash function, and the whirlpool hash function. SHA-512 is a variant of SHA-2 designed by the National Security Agency (NSA), while the Whirlpool hash algorithm was developed by 2 people, Vincent Rijmen and Paulo S.L.M. Barreto. These two hash functions are hash functions that are considered to have high security. In these two hash algorithms, there is still no collision in the hash value. This study will discuss the differences and similarities of the two algorithms

HMNT: Hash Function Based on New Mersenne Number Transform

In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient and have security flaws (such as a lack of collision resistance or susceptibility to birthday attacks). In the current study, we propose a novel hash function scheme based on a new Mersenne number transform. The suggested hash function called Hash Mersenne Number Transform (HMNT) takes an arbitrary length as input to generate a hash value with variable lengths (128, 256 and 512-bits or longer). The proposed scheme is evaluated in terms of the sensitivity of the hash value to the message, secret key and image, distribution of hashes, confusion and diffusion, robustness against collision and birthday attacks, alongside flexibility. Based on the simulation outcomes, the suggested scheme possess high sensitivity to the original message, the secret key and images, along with strong collision resistance. In conclusion, the proposed hash scheme is simple and efficient compared with the existing hash functions, making it viable for practical implementation.

Double-Bit Quantization and Index Hashing for Nearest Neighbor Search

As binary code is storage efficient and fast to compute, it has become a trend to compact real-valued data to binary codes for the nearest neighbors (NN) search in a large-scale database. However, the use of binary code for the NN search leads to low retrieval accuracy. To increase the discriminability of the binary codes of existing hash functions, in this paper, we propose a framework of double-bit quantization and index hashing for an effective NN search. The main contributions of our framework are: first, a novel double-bit quantization (DBQ) is designed to assign more bits to each dimension for higher retrieval accuracy; second, a double-bit index hashing (DBIH) is presented to efficiently index binary codes generated by DBQ; and third, a weighted distance measurement for DBQ binary codes is put forward to re-rank the search results from DBIH. The empirical results on three benchmark databases demonstrate the superiority of our framework over existing approaches in terms of both retrieval accuracy and query efficiency. Specifically, we observe an absolute improvement on precision of 10%-25% in most cases and the query speed increases over 30 times compared to traditional binary embedding methods and linear scan, respectively.

A secure hash function based on feedback iterative structure

ABSTRACTRapid growth of internet data has created enormous security challenges on authenticity, availability and integrity protection of these outsourced data. Hash function is one of the main solutions to face these challenges. This paper proposes a feedback iterative structure of hash function which utilises the variable feedback to resist attacks. Furthermore, to accelerate message diffusion, two novel modules are designed, one for iteration and the other for truncation. Experimental results show that the proposed hash function can effectively resist existing attacks. Moreover, comparing with other existing hash functions, it displays better on statistical performance, collision resistance and avalanche.

Adaptive Hashing with Sparse Modification for Scalable Image Retrieval

Approximate Nearest Neighbor (ANN) search is a challenging problem with the explosive high-dimensional large-scale data in recent years. The promising technique for ANN search include hashing methods which generate compact binary codes by designing effective hash functions. However, lack of an optimal regularization is the key limitation of most of the existing hash functions. To this end, a new method called Adaptive Hashing with Sparse Modification (AHSM) is proposed. In AHSM, codes consist of vertices on the hypercube and the projection matrix is divided into two separate matrices. Data is rotated through a orthogonal matrix first and modified by a sparse matrix. Here the sparse matrix needs to be learned as a regularization item of hash function which is used to avoid overfitting and reduce quantization distortion. Totally, AHSM has two advantages: improvement of the accuracy without any time cost increasement. Furthermore, we extend AHSM to a supervised version, called Supervised Adaptive Hashing with Sparse Modification (SAHSM), by introducing Canonical Correlation Analysis (CCA) to the original data. Experiments show that the AHSM method stably surpasses several state-of-the-art hashing methods on four data sets. And at the same time, we compare three unsupervised hashing methods with their corresponding supervised version (including SAHSM) on three data sets with labels known. Similarly, SAHSM outperforms other methods on most of the hash bits.

A new and fast cryptographic hash function based on RC4

ABSTRACTThis article proposes a new cryptographic hash function, called RC4-BHF, which is designed to be both fast and secure. This is a new attempt to design a cryptographic hash function based on the RC4 algorithm. Since vulnerabilities have been discovered in many of the existing hash functions, it is beneficial to construct a hash function which has different internal structure, and RC4-BHF is such a new hash function. Moreover, RC4-BHF is suitable for ultra-low power devices, such as sensor node, which are normally equipped with 8-bit processors, and most other hash functions cannot be implemented efficiently or are not applicable. RC4-BHF can run much faster compared to the existing well-known hash functions and is exceptionally fast on 8-bit processors.

Open problems in hash function security

A cryptographic hash function compresses arbitrarily long messages to digests of a short and fixed length. Most of existing hash functions are designed to evaluate a compression function with a finite domain in a mode of operation, and the compression function itself is often designed from block ciphers or permutations. This modular design approach allows for a rigorous security analysis via means of both cryptanalysis and provable security. We present a survey on the state of the art in hash function security and modular design analysis. We focus on existing security models and definitions, as well as on the security aspects of designing secure compression functions (indirectly) from either block ciphers or permutations. In all of these directions, we identify open problems that, once solved, would allow for an increased confidence in the use of cryptographic hash functions.

Hash function‐based secret sharing scheme designs

ABSTRACTSecret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t + 1, n) threshold scheme that is perfect and ideal and then extend it to schemes for any general access structure. The schemes can be further set up as proactive or verifiable if necessary. The setup and recovery of the secret are efficient because of the fast calculation of the hash function. The proposed scheme is flexible because of the use of existing hash functions. Copyright © 2012 John Wiley & Sons, Ltd.

On security arguments of the second round SHA-3 candidates

In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs: (1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.

Keyed hash function based on a chaotic map

Secure hash functions play a fundamental role in cryptographic and Web applications. They are mainly used, within digital signature schemes, to verify the integrity and authenticity of information. In this paper, we propose a simple and efficient keyed hash function based on a single chaotic map. Theoretical and simulation results demonstrate that the suggested scheme satisfies all cryptographic requirements of secure keyed hash functions such as strong confusion and diffusion capability, good collision resistance, high sensitivity to message and secret key, etc. Furthermore, it is fast and can be easily implemented through software or hardware. Moreover, the length of the hash value is flexible without any impact on the algorithm. This function is shown to have better statistical performance than many existing hash functions. Thus, the suggested hash function seems to be a good candidate as a secure keyed hash function for use in cryptographic applications.