DAT305_wk3_Cryptographic_Hash_Function.assignment.docx Cryptographic Hash Function DAT

DAT305_wk3_Cryptographic_Hash_Function.assignment.docx    Cryptographic Hash Function  DAT 305    A cryptographic hash function is a function (or tool) that is used for modern cryptography; it is a mathematical algorithm that maps data of size, to a bit string of a fixed size and is a one way function “ meaning, it can not be inverted. In most cases, the only way to find a message that produces a given hash is to attempt a brute-force search of possible inputs to see if they can produce a match.   List and define the main properties of an ideal cryptographic hash function.  ï‚·Computationally Efficient  ï‚·Deterministic  ï‚·Pre-Image Resistant  ï‚·Collision Resistant  ï‚·Impossible To Reverse Engineer  Computationally Efficient  What does this mean? It means that the computer(s) must be able to perform the hash function™s mathematical labor in a very short period of time. If an ordinary computer needs several minutes to process the hash function, it would not be ideal. In order to be useful, they must compute efficiently. If you take a look back on how computers have changed, this is not really an issue. Most computers can process algorithms in a matter of seconds.   Deterministic  What does this mean? It means that for any given input, the hash function must always give the same result. If you input the same thing a million times in a row, the hash function must produce the same exact output. If the cryptographic hash function is to produce a different output each time, it is essentially useless “ it would be impossible to verif