h. daghigh

Cryptographic hash functions are the linchpins of mobile services, blockchains, and many other technologies. Designing cryptographic hash functions has been approached by research communities from the physics, mathematics, computer science, and electrical engineering fields. The emergence of new hash functions, new hash constructions, and new requirements for application-specific hash functions, such as the ones of mobile services, have encouraged us to make a comparison of different hash functions and propose a new classification.

Over 100 papers were surveyed and reviewed in detail. The research conducted in this paper has included four sections; article selection, detailed review of selected articles, data collection, and evaluation of results. Data were collected as new hash function properties, new hash function constructions, new hash function categories, and existing hash function attacks which are used to evaluate the results.

This paper surveys seven categories of hash functions including block cipher-based functions, algebraic-based functions, custom-designed functions, Memory-hard Functions (MHFs), Physical Unclonable Functions (PUFs), quantum hash functions and optical hash functions. To the best of our knowledge, the last four mentioned categories have not been sufficiently addressed in most existing surveys. Furthermore, this paper overviews hash-related adversaries and six hash construction variants. In addition, we employed the mentioned adversaries as evaluation criteria to illustrate how different categories of hash functions withstand the mentioned adversaries. Finally, the surveyed hash function categories were evaluated against mobile service requirements.

In addition to new classification, our findings suggest using PUFs with polynomial-time error correction or possibly bitwise equivalents of algebraic structures that belongs to post-quantum cryptography as candidates to assist mobile service interaction requirements.

The existence of silty sand in the infrastructure under concrete constructions, hydraulic structures, and irrigation systems has always caused challenges. Improving this kind of soil is always a challenging approach to increase compressive strength and shear stress. There is a conception that adding some extra material such as concrete can increase the stability of this soil against contributed forces. The present study investigated the effects of curing time (3, 7, 14, 21, and 28 days) and different percentages of various additives (3%, 5%, and 7%) on the strength of the silty sand soils. A series of laboratory tests were carried out to measure the Uniaxial Compressive Strength (UCS) and California Bearing Ratio (CBR) by evaluating the effect of additives on the strength parameters of silty sand soil. In total, 299 experimental tests have been conducted in the soil mechanics laboratory of SRBIAU. Results indicated that adding additives such as concrete to silty sand soil improved significantly the compressive strength and shear strength. The comparisons among the experimental test illustrate that due to increasing the curing time, the aforementioned parameters were increased significantly; however, Confix and Bentonite aggregates did not have a marginal effect on the compressive strength and shear strength. Also, after the 21st day of the curing time, the rate of increment of the UCS and CBR reached slightly and then attained a constant value. Also, after this duration, the curing time is an independent factor in the variation of the UCS and CBR tests. Furthermore, the addition of 5% Pozzolana cement and 7% Portland cement with 28 days of curing had the highest CBR number and UCS resistance of 176.26 and 17.58 kg/cm2, respectively. Also, the sketch of the different failure patterns was shown during the curing time. Finally, by increasing the curing time, the behavior of specimens from semi-brittle to brittle made them harder.

In this article, we present a non-interactive key exchange protocol with a faster run time, which is based on a Module-LWE. The Structure of protocol is designed just by relating the error vectors of both sides, without any use of a reconciliation mechanism. The idea is that as error vectors get closer to each other the success probability of the protocol increases. The innovation in this scheme is the use of high-order bits in the keys computed by both sides. Compared to the existing lattice-based key-exchange protocols, this scheme leads to lower computational complexity and longer parameters.