Tag Archives: Hash

Eden Block: Hash Function

Instead of using public and private keys for encryption and decryption (as with ECC and RSA), a hash function can be used to secure data. A hash function processes plaintext of any size and creates a unique, fixed-length identifier. In other words, hash functions take the generic text (like this article) and turn it into a string of numbers and letters. This hash is unique to the message; this means that Message A and Message B cannot have the same hash function and that Message A will always have the same hash provided that the message doesn’t change. Additionally, any change to the original message will produce an entirely different hash. This is also called a collision-resistant hash function, meaning that no two different messages will produce the same hash. The resulting hash usually has a size between 128 and 512 bits. Continue reading Eden Block: Hash Function