Originally posted by liam
View Post
Announcement
Collapse
No announcement yet.
BLAKE2: A New Alternative To MD5 & SHA-2/SHA-3
Collapse
X
-
-
Originally posted by MaxToTheMax View PostImproved performance isn't necessarily a good thing, when it comes to these sorts of hash functions. The faster a hash function, the easier it is to brute-force.
The takeaway message for us lowly non-security types was pretty simple, yet none of us got it: I'll be pretty happy when I can replace the md5sum command line tool with something faster that I can have a reasonable amount of confidence in.
Leave a comment:
-
Originally posted by Licaon View PostSo decide already, it was either a finalist or a redesign, it can't be both.
So, as I said, it may be a reimplementation of a sha3 finalist algorithm.
Leave a comment:
-
Originally posted by liam View PostThe article claimed BLAKE2 was a finalist. According to this link, http://crypto.junod.info/2010/12/10/...unced-by-nist/, it was a finalist (well, BLAKE was, I'm assuming BLAKE2 is simply a different implementation.
Leave a comment:
-
Originally posted by zanny View PostKeccak and Sha2-256 or greater can't be brute forced.
Leave a comment:
-
Originally posted by MaxToTheMax View PostImproved performance isn't necessarily a good thing, when it comes to these sorts of hash functions. The faster a hash function, the easier it is to brute-force. When Intel added SHA hardware instructions, they weren't necessarily making SHA better, they were bringing it closer to obsolescence (for certain applications.)
And if you really wanted to be OCD, 512 bit keyspace (or just 384) is laughably impossible to even consider brute forcing. But 256 bit is already impossible. The lowest used key space for either algorithm is 224 bits, which is just as crazy. Here is the wikipedia entry on 128 bit vs 256 bit keyspace brute forcing:
AES permits the use of 256-bit keys. Breaking a symmetric 256-bit key by brute force requires 2128 times more computational power than a 128-bit key. A device that could check a billion billion (10^18) AES keys per second (if such a device could ever be made - as of 2012, supercomputers have computing capacities of 20 Peta-FLOPS, see Titan. So 50 supercomputers would be required to process (1018) operations per second) would in theory require about 3?10^51 years to exhaust the 256-bit key space.Last edited by zanny; 24 December 2012, 09:00 PM.
Leave a comment:
-
Guest repliedOriginally posted by MaxToTheMax View PostImproved performance isn't necessarily a good thing, when it comes to these sorts of hash functions. The faster a hash function, the easier it is to brute-force. When Intel added SHA hardware instructions, they weren't necessarily making SHA better, they were bringing it closer to obsolescence (for certain applications.)
(I need make my message at least 10 chars long. what a stupid cms)
Leave a comment:
-
Originally posted by Licaon View PostSo instead of using the winner of the SHA-3 competition or even one of the finalists that were under a lot of checks and scrutiny, let's take one of those finalists, redesign it and call it better? 4real?
Leave a comment:
-
Improved performance isn't necessarily a good thing, when it comes to these sorts of hash functions. The faster a hash function, the easier it is to brute-force. When Intel added SHA hardware instructions, they weren't necessarily making SHA better, they were bringing it closer to obsolescence (for certain applications.)
Leave a comment:
-
I'm having problems convincing others they should use SHA2 over MD5, let alone SHA3. Bringing an exotic solution to the table would put me in an awkward position.
It's good there's research in the area, maybe this will grow into SHA4. But I don't think it's worth raving about it just yet.
Leave a comment:
Leave a comment: