swMATH ID: 2762
Software Authors: Pal, Pinakpani; Sarkar, Palash
Description: 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.
Homepage: http://www.springerlink.com/content/c2v6e9ubvl0altue/fulltext.pdf
Keywords: hash function; SHA-256; parallel algorithm; binary tree
Related Software: Keccak; Whirlpool
Cited in: 5 Publications

Citations by Year