<span>Nowadays, cryptography especially hash functions require to move from classical paradigms to an original concept able to handle security issues and new hardware architecture challenges as in distributed systems. In fact, most of current hash functions apply the same design pattern that was proved vulnerable against security threats; hence the impact of a potential weakness can be costly. Thus, the solution begins with a deep analysis of divers attack strategies; this way can lead to finding a new approach that enables new innovative and reliable candidates as alternative hash functions. So to achieve this goal, in this article we introduce a new construction design that consists of a non-iterative behavior by combining a parallel block processing and a sequential xor addition process, in order to provide a secure design without changing the expected goal of a hash function, at the same time avoid the use of vulnerable structures.</span>

<span>The non-iterative hash function design is a domain extension that uses a novel concept to fill a gap in existing cryptographic designs. This design avoids the structural issues that plagued prior paradigms, particularly those applying the Merkel-Damgârd design, by presenting a novel approach. Non-iterative hash function design, on the other hand, is an abstract idea that necessitates the specification of the internal transformation in order to test and experiment it. To achieve this goal, this article describes the algorithm that implements the internal transformation based on the main characteristics of the new model. The avalanche effect's results are provided in the experiment section, as well as a preliminary validation stage of the national institute of standards and technology (NIST's) cryptographic algorithm validation program (CAVP), which employs a set of test vectors to verify algorithm accuracy and implementation errors.</span>