Paper 2009/033

NESHA-256, NEw 256-bit Secure Hash Algorithm (Extended Abstract)

Yaser Esmaeili Salehani, Amir Tabatabaei, Mohammad Reza Sohizadeh Abyaneh, and Mehdi Mohammad Hassanzadeh


In this paper, we introduce a new dedicated 256-bit hash function: NESHA-256. The recently contest for hash functions held by NIST, motivates us to design the new hash function which has a parallel structure. Advantages of parallel structures and also using some ideas from the designing procedure of block-cipher-based hash functions strengthen our proposed hash function both in security and in efficiency. NESHA-256 is designed not only to have higher security but also to be faster than SHA-256: the performance of NESHA-256 is at least 38% better than that of SHA-256 in software. We give security proofs supporting our design, against existing known cryptographic attacks on hash functions.

Note: This hash function has been designed for presenting in NIST contest. Because of deadline we were not successful to prepare the full package before deadline. SO, we have decided to submit it to eprint archive and some other new future on coming valuable conferences. We hope that the paper can be useful for researcher involved in hash function designing. We would be happy to receive any useful comment and suggestion about our work. S. Amir Hossein A. E. Tabatabaei

Available format(s)
Publication info
Published elsewhere. This paper has been accepted in the workshop WCC'09 which will be held on 10-15 May 2009 in Norway.
Hash functionNISTDiffusion layerDifferential attack
Contact author(s)
tabatabaei amirhossein @ gmail com
2009-05-02: revised
2009-01-17: received
See all versions
Short URL
Creative Commons Attribution


      author = {Yaser Esmaeili Salehani and Amir Tabatabaei and Mohammad Reza Sohizadeh Abyaneh and Mehdi Mohammad Hassanzadeh},
      title = {NESHA-256, NEw 256-bit Secure Hash Algorithm (Extended Abstract)},
      howpublished = {Cryptology ePrint Archive, Paper 2009/033},
      year = {2009},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.