Omega Network Hash Construction
Chai Wen Chuah and Azman Samsudin
DOI : 10.3844/jcssp.2009.962.973
Journal of Computer Science
Volume 5, Issue 12
Problem statement: Cryptographic hash functions are important cryptographic primitives. They are commonly used for data integrity checking and data authentication. Most of the cryptographic hash functions are based on the Merkle-Damgård construction. The basic Merkle-Damgård construction runs over the input sequentially, which can lead to problems when the input size is large since the computation time increases linearly. Approach: Therefore, an alternative architecture which can reduce the computation time is needed, especially in today’s world where multi-core processors and multithreaded programming are common. An Omega Network Hash Construction (ONHC) run parallel in multi-core machine has been proposed as an alternative to the existing hash constructions. Result: The ONHC performed better than the Merkle-Damgård construction. ONHC permutation architecture also showed improved security strength in term of digest value randomness when compared to Merkle-Damgård construction. Conclusion: Therefore, it is believed that the proposed ONHC is a valuable structure that can improve the performance of any hash function that can run on top of it.
© 2009 Chai Wen Chuah and Azman Samsudin. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.