Steven Lembark [EMAIL PROTECTED] at Thursday 26 June 2008, 23:52:17
I submit that brute forcing an AES key of reasonably length is
currently impossible in an amount of time that would matter to the
human race.
On average yes.
As already pointed out, however, there is nothing
to
On Thursday 26 June 2008, Chris Walters wrote:
Sebastian Wiesner wrote:
| I don't and I did not say so, things like the Debian disaster bring
| you back to reality from dreams ...
This is the favoured method of cracking encryption - misuse by the user.
The canonical example is of course
Alan McKinnon wrote:
The calculation is quite simple - measure how quickly a specific
computer can match keys. Divide this into the size of the keyspace. The
average time to brute force a key is half that value. AFAIK this still
averages out at enormous numbers of years, even at insane
Alan McKinnon [EMAIL PROTECTED] at Thursday 26 June 2008, 10:54:43
The calculation is quite simple - measure how quickly a specific
computer can match keys. Divide this into the size of the keyspace. The
average time to brute force a key is half that value. AFAIK this still
averages out at
On Thursday 26 June 2008, Sebastian Wiesner wrote:
Alan McKinnon [EMAIL PROTECTED] at Thursday 26 June 2008,
10:54:43
The calculation is quite simple - measure how quickly a specific
computer can match keys. Divide this into the size of the keyspace.
The average time to brute force a key
I submit that brute forcing an AES key of reasonably length is
currently impossible in an amount of time that would matter to the human
race.
On average yes.
As already pointed out, however, there is nothing
to prevent the first guess from matching a key and
cracking one particular
Steven Lembark wrote:
I submit that brute forcing an AES key of reasonably length is
currently impossible in an amount of time that would matter to the
human race.
On average yes.
As already pointed out, however, there is nothing
to prevent the first guess from matching a key and
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
Sebastian Wiesner wrote:
| Jason Rivard [EMAIL PROTECTED] at Wednesday 25 June 2008, 23:53:23
[snip]
| A OTP cannot be broken using brute force, so the term perfectly secure
| fits here, imho, at least a bit ;)
A OTP cipher would be
8 matches
Mail list logo
