Paper 2023/110

VORSHA: A Variable-sized, One-way and Randomized Secure Hash Algorithm

Ripon Patgiri, National Institute of Technology Silchar
Laiphrakpam Dolendro Singh, National Institute of Technology Silchar
Dalton Meitei Thounaojam

In this paper, we propose a variable-sized, one-way, and randomized secure hash algorithm, VORSHA for short. We present six variants of VORSHA, which are able to generate a randomized secure hash value. VORSHA is the first secure hash algorithm to randomize the secure hash value fully. The key embodiment of our proposed algorithm is to generate a pool of pseudo-random bits using the primary hash functions and selects a few bits from the pool of bits to form the final randomized secure hash value. Each hash value of the primary hash function produces a single bit (either 0 or 1) for the pool of pseudo-random bits. Thus, VORSHA randomized the generated bit string to produce the secure hash value, and we term it as a randomized secure hash value. Moreover, the randomized secure hash value is tested using NIST-SP 800-22 statistical test suite, and the generated randomized secure hash value of VORSHA has passed all 15 statistical tests of NIST-SP 800-22. It proves that the VORSHA is able to generate a highly unpredictable yet consistent secure hash value. Moreover, VORSHA features a memory-hardness property to restrict a high degree of parallelism, which features a tiny memory footprint for legal users but massive memory requirements for adversaries. Furthermore, we demonstrate how to prevent Rainbow Table as a Service (RTaaS) attack using VORSHA. The source code is available at

Available format(s)
Publication info
Secure Hash Algorithm
Contact author(s)
ripon @ cse nits ac in
ldsingh @ cse nits ac in
dalton @ cse nits ac in
2023-01-31: last of 2 revisions
2023-01-28: received
See all versions
Short URL
Creative Commons Attribution-NonCommercial


      author = {Ripon Patgiri and Laiphrakpam Dolendro Singh and Dalton Meitei Thounaojam},
      title = {VORSHA: A Variable-sized, One-way and Randomized Secure Hash Algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2023/110},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.