What is the etymology of hashing and why is that term used in computer science?

Hashen is the one-sided encoding of something.To put it very simply, suppose you have a password. Pass123.
Under the hood are these bytes, and lower bits.01100101110011…

When hashing is released an algorithm that converts this into something unreadable like for example Fe405gr9r909fe

Important, this is not the same as encrypting.In hashing, an interpretation is formed of the data that is hashed and the algorithm will have one outcome. But unlike encryption, you cannot reverse it (decrypt) because it is not known how the result is obtained. With encryption, there is a fixed algorithm that is executed per character. For example the letter B is always 1 and the letter C is always 4. Then BC is always 14. For example, when hashing, BC will be 254 while A is 1 and B 4.

Therefore, passwords are normally hashed because it is not intended to be someone who could ever decrypt.Only the user should know the password. So when you enter a password, the hash is stored in a database. The next time you enter your password, the same hash will be generated and compared if it is correct with the hash in the database.

Maybe you’ve also heard about MD5 hashes that sometimes show up when downloading files.This is the same principle, the file consists of a certain set of bits and once someone has done something with the code, these bits will be different. This ensures that the hash of the file will be different than the original. This way you can hash the file you download and compare the outcome with what is given on the official site to make sure that unknowns with potentially bad intentions have not adapted to the file.

Hasing is related to Dutch Hutsen.Hash is a kind of stew, akin to the French hach茅e.

Hashing is an irreversible scrambling system.
Encrypting uses a reversible scrambling system.
Secure storage of passwords uses hashing.

Examples of hashing is 3×4 = 12. 12 is then the hash.
You don’t know if the original was 2×6 or 1×12 or 3×4 or 4×3…

But what you do know is that if you typed 3×4 in that the hash is 12.
So if your password is hash 12 and it says in the database that your password hash is 12 then no one knows your password, but that what you specify is good.

Password hashes should be safe.And not too often collide with other hashes. 3×4 = 12 is therefore a bad example: it collists too often with other possibilities. It doesn’t matter if I specify 3×4 or 2×6 or 1×12, the password check will find them all right.
A better hash is to not only multiply, but also to roll.
If a result is 1234 you can make 4123 of it and multiply again.
If a result is too large you can cut pieces from it.
1234×2341 = 2888794 = > 2888

Pieces from clipping also make it very difficult to figure out the original, but the same word entered will always have the same hash (scrambling).

Leave a Reply