>>>>> Jerome Baum <jerome+per...@jeromebaum.com> writes:
>>>>> On 2011-10-10 23:29, Jan Janka wrote:
>> How long would it take to execute a successful brute force attack on
>> a pasphrase consisting of 12 symbols (symbols available on common
>> keyboards)?
> Calculate how many combinations there are, assume some number of
> tries per second (you can experimentally find this out), and there
> you go.
> But remember Murphy's(?) law! -- (I mean the one about doubling
> computer power every 18 months -- are there two Murphy's laws?
> Confused now...)
That's used to be Moore's [1].
On a second thought, I guess that /both/ of them are to be
considered when it comes to information security.
[1] http://en.wikipedia.org/wiki/Moore's_law
[…]
--
FSF associate member #7257
_______________________________________________
Gnupg-users mailing list
Gnupg-users@gnupg.org
http://lists.gnupg.org/mailman/listinfo/gnupg-users
