DefinePK

Abstract

Cryptographic hash functions are used to protect the integrity of information. Hash functions are implemented in applications such as; Message Authentication Codes, pseudo random number generators and key derivation functions. Thus, this arguably suggests the need for continuous development of hash functions. Traditionally, hash functions are designed based on existing block ciphers due to challenges and difficulties faced in constructing new hash functions from the scratch. However, the key generation for each encryption process results to huge computational cost. In order to reduce computational cost, only a limited instantiations of the block cipher such as the permutations and boolean operators are used as the underlying compression functions. Few works have been proposed in developing a less computational cost but secure and efficient compression function. This paper proposes a different approach (PQ and 3PQ) in constructing compression function based on permutations and non-associative quasi group. Analysis of experimentation results have demonstrated that the proposed compression functions are suitable for operation in constraints environments (both memory and processing power) with very minimal computational cost. Similarly, the obtained results also shows the proposed compression functions have an effective one-way function, strong avalanche property and easy to implement.