Omega network hash construction

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-Damgard construction. The basic Merkle-Damgard 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-Damgard construction. ONHC permutation architecture also showed improved security strength in term of digest value randomness when compared to Merkle-Damgard 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.

[1]  Kee-Young Yoo,et al.  A Virtual Three-Dimension Cellular Automata Pseudorandom Number Generator Based on the Moore Neighborhood Method , 2008, ICIC.

[2]  H.M. Elkamchouchi,et al.  A New Secure Hash Dynamic Structure Algorithm (SHDSA) for Public Key Digital Signature Schemes , 2006, Proceedings of the Twenty Third National Radio Science Conference (NRSC'2006).

[3]  William Millan,et al.  Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction , 2006, ACISP.

[4]  H.M. Elkamchouchi,et al.  A new secure and fast hashing algorithm (SFHA-256) , 2008, 2008 National Radio Science Conference.

[5]  Yi Pan,et al.  Evolutionary approach for message scheduling in optical Omega networks , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[6]  Yi Pan,et al.  Equivalent permutation capabilities between time division optical omega network and non-optical extra stage omega network , 1999, 1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305).

[7]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[8]  Dong-Ho Lee,et al.  Pseudorandom Number Generation Using Cellular Automata , 2008 .

[9]  Seyed H. Roosta.  Principles of Parallel Programming , 2000 .

[10]  Marek Jackiewicz,et al.  Analysis of non-linear pseudo-noise sequences , 2005, Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems.

[11]  S. Choomchuay,et al.  An Architecture for a SHA-1 Applied for DSA , 2004 .

[12]  H. Mirvaziri,et al.  Collision Free Hash Function Based on Miyaguchi-Preneel and Enhanced Merkie-Damgard Scheme , 2007, 2007 5th Student Conference on Research and Development.

[13]  Alejandro Duran,et al.  The Design of OpenMP Tasks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[14]  S. Das,et al.  Analysis of the effect of size of omega network on its fault tolerance behaviour in presence of multiple faults , 1994, Proceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'.

[15]  Daniel J. Rosenkrantz,et al.  Partitioning Message Patterns for Bundled Omega Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[16]  Injoo Jang,et al.  Pseudorandom Number Generator Using Optimal Normal Basis , 2006, ICCSA.

[17]  Matthew Haines,et al.  Approaches for integrating task and data parallelism , 1998, IEEE Concurr..

[18]  Lawrence Snyder,et al.  Principles of Parallel Programming , 2008 .

[19]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[20]  Imtiaz Ahmad,et al.  Hardware implementation analysis of SHA-256 and SHA-512 algorithms on FPGAs , 2005, Comput. Electr. Eng..

[21]  G. Marsaglia,et al.  Some Difficult-to-pass Tests of Randomness , 2022 .

[22]  Ken Umeno,et al.  Corrections of the NIST Statistical Test Suite for Randomness , 2004, IACR Cryptol. ePrint Arch..

[23]  Berk Sunar,et al.  True Random Number Generators for Cryptography , 2009, Cryptographic Engineering.

[24]  Sareh Sadat Emami,et al.  Design and Implementation of a Fast, Combined SHA-512 on FPGA , 2007 .

[25]  Yi Pan,et al.  Equivalent permutation capabilities between time-division optical omega networks and non-optical extra-stage omega networks , 2001, TNET.