A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses

Abstract

The data breach and the integrity violation of remote data remain significant issues in the domain of information security. A provably-secure hash function aids in providing solutions to integrity-related issues. Nevertheless, the choice of a provably-secure hash function has to be made with caution from the perspective of security. This research study attempts to identify the weakness of contemporary keyless hash functions and proposes an algorithm called a provably secure subset hash function (PSSHF). The objectives of the studies are reinforcing the internal structure of random oracle (RO), intensifying stochastic deportment, presenting computationally infeasible conditions for reverse decoding, and forestalling block-level and differential attacks through subsets and polynomial functions. The avalanche response of PSSHF is 50.06% and is higher than that of its contemporary variants. Likewise, the Near-collision response of PSSHF is 49.94% and is the least among its other similitudes. The empirical analysis of the effect of avalanche proves the novel design modifies 93.78% of output symbols besides excelling its other counterparts on random behavior. The runtime response proves the PSSHF processes short messages with acceptable delay. Therefore, the proposed PSSHF can be considered a perfect replacement for its similitudes in respect of the short messages for higher security.