Please enable JavaScript.
Coggle requires JavaScript to display documents.
ALGORITHMS & TECHNIQUES, HASHING, NOTE :explode:, IMPORTANT :star: -…
-
HASHING
-
A hash function or hashing transforms and maps an arbitrary length of input data value to a unique fixed length value. Input data can be a document, tree data or a block data
-
Requirements
- The algorithm chosen for the hash function should be a one-way function
- it should be collision free, or exhibit extremely low probability of collision.
The second requirement is to make sure that the hash value uniquely represents the original items hashed
There should be extremely low probability that two different datasets map onto the same hash value
Common functions - SHA-3, SHA-256 and Keccak
Most common hash size now is 256 bits
SHA - SECURE HASH ALGORITHM
NOTE :explode:
Pre-Image Resistance: Given the outputs It is Computationally Infeasible to find any input which hashes to a certain output
Collision Resistance : It is computationally infeasible to find any two distinct inputs which hash to the same output
-