Attention: if you attempt to fork this gist, github will think that you are a spammer and you will have to confirm that you are human with them. Apparantly there are too many links in this list. Also I update it rather frequently (see revisions on the left), so it's probably wise to not fork it anyway.
BLOG ON CRYPTOGRAPHY Today, people in general relate to cryptography mostly in regard to the security of their passwords. The passwords are worthless if others have resources to know it.
Today most of the websites dont simply use cryptographic hash functions like SHA256, MD5 etc. directly on the password. Instead random bits ( salt ) are added while encrypting them so that even when two users enter the same password the hashes that are generated are different from each other.
Hashes like SHA1 , SHA256, MD5 etc. are general purpose hashes. They have been designed to hash a large amount of data as quickly as possible.
An encryption algorithm for securely storing your password should have the following characteristics:
Preimage resistance: Given h, it should be hard to find any value x with h = H(x).
BLOG ON CRYPTOGRAPHY | |
Today, people in general relate to cryptography mostly in regard to the security of their passwords. The passwords are worthless if others have resources to know it. | |
Today most of the websites dont simply use cryptographic hash functions like SHA256, MD5 etc. directly on the password. Instead random bits ( salt ) is added while encrypting them so that even when two users enter the same password the hashes that are generated are different from each other. | |
Hashes like SHA1 , SHA256, MD5 etc. are general purpose hashes. They have been designed to hash a large amount of data as quickly as possible. | |
An encryption algorithm for securely storing your password should have the following characteristics: | |
1. preimage resistance: Given h, it should be hard to find any value x with h = H(x). | |
2. second preimage resistance: Given x1, it should be hard to find x2 != x1 with H(x1) = H (x2). | |
3. collision resistance: It should be hard to find two values x1 != x2 with H(x1) = H(x2). |