PARSHA-256 -- a new parallelizable hash function and a multithreaded implementation. In this paper, we design a new hash function PARSHA-256. PARSHA-256 uses the compression function of SHA-256 along with the Sarkar-Schellenberg composition principle. As a consequence, PARSHA-256 is collision resistant if the compression function of SHA-256 is collision resistant. On the other hand, PARSHA-256 can be implemented using a binary tree of processors, resulting in a significant speed-up over SHA-256. We also show that PARSHA-256 can be efficiently implemented through concurrent programming on a single processor machine using a multithreaded approach. Experimental results on P4 running Linux show that for long messages the multithreaded implementation is faster than SHA-256.
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Preneel, Bart: The NIST SHA-3 competition: a perspective on the final year (2011)
- Preneel, Bart: The first 30 years of cryptographic hash functions and the NIST SHA-3 competition (2010)
- Preneel, Bart: The state of hash functions and the NIST SHA-3 competition. Extended abstract (2009)
- Yung, Moti (ed.); Liu, Peng (ed.); Lin, Dongdai (ed.): Information security and cryptology. 4th international conference, Inscrypt 2008, Beijing, China, December 14--17, 2008. Revised selected papers (2009)
- Pal, Pinakpani; Sarkar, Palash: PARSHA-256 -- a new parallelizable hash function and a multithreaded implementation. (2003)