One of the problems of hash functions is collisions, they cause some security vulnerabilities which won’t be discussed in this article.
In this article I would like to find some approximations concerning collisions.
Probability for a collision
Let \(\mathbf{M}\) be the size of the range (i.e. for md5 it is \(2^{128}\) since md5 returns 128 [...]
Yesterday I have published an article about password entropy.
Today I would like to discuss the entropy of a phrase based password.
Phrase Based Password
A phrase based password is a password assembled from several easy to remember and spell words, delimited by spaces.
As a result, such passwords are very [...]
A common and easy way to estimate the strength of a password is its entropy.
The entropy is given by \(H = L \log_2{N}\) where \(L\) is the length of the password and \(N\) is the size of the alphabet, and it is usually measured in bits.
The entropy measures the number of [...]
In this article I will explain the method I suggest for hashing password and saving them in a database.
First of all, never insert passwords to the database as plain text!
If your database is stolen your users will pay the price (maybe you will have to pay them for the damage you have [...]
Categories
