Here is an estimate of the time required for an exhaustive password search attack, when the
password is a random sequence of lowercase Latin letters.
We suppose that one user can check 10 passwords per second and an organization with a
budget of about $1 billion can check 10 billion passwords per second. We also suppose that
the processor in use doubles its performance every two years; so, each additional Latin letter
of a long password adds about 9 years to an exhaustive key search attack.

The result is this estimate of the time to succeed in an attack:

We will be posting information here on a regular basis with the main focus on data security.
This will be where we put our opions up on the current issues, we will answer data security concerns and provide recommendations.

We are also hoping to invite guest posts – providing as much variety as we can.

Thats all for now,

Your DataDiscretion Team