Security aspects of the Cayley hash function using discrete heisenberg group

Abstract

We execute the average running time of the various binary strings of different length and evaluate the other useful characteristics of a hash function which is to be Pseudo-Randomness of a hash function,which can assigned Uniformly over the range [0,p) to reduce the chance of occurring collisions. We also verify the security properties of the hash function using different attacks.

Subject Classification:

• 94A60
• 20F65
• 15A30
• 11B13

Keywords:

• Cryptographic Hash Function
• Discrete Heisenberg Group
• Goodness-of-fit test
• Different Attacks