Earlier quoted context omitted.
Its deeply troublesome when these kinds of comments come up for two reasons: first and lesser: its wrong; secondly: its inconspicuously wrong. Processor speeds double approximately every generation which we can estimate is once every two years. What do we have to count to: 2^128 = 3.402823669209385e+38 How many times can we count in a year with a 3GHz core: 3e9 * 3600 * 24 * 365.24 = 9.4670208e+16 In two years, when…
> Processor speeds double approximately every generation which we can estimate is once every two years. Do you have any sources to back up this claim? Max processor speed has stalled to ~4GHz since 2005. If you're referring to Moore's law, it concerns the amount of transistors in ICs, and will eventually hit a limit (not before 10 years, but not after 140 years).
What is going on with NIST’s SHA-3?
41–50 of 50 posts
Re: What is going on with NIST’s SHA-3?
#42Basically, NIST seems to be reasoning that because Keccack's sponge construction has no internal resistance to meet-in-the-middle attacks, the collision and preimage resistances are the same. An upper bound on the security of Keccack is set by the expression c + r = 1600. 'c' represents the internal bandwidth of the hash that is not directly controllable by an attacker. 'r' is the rate (bits per expensive f() functio…
I guess I don't really understand the objection to NIST's reasoning. While a larger capacity (c) would increase pre-image resistance, it wouldn't help generic collision resistance (which would always be limited by the output size). There are certainly contexts where a pre-image attack would be more damaging than a collision, but collisions can be a problem in other situations. Asking the user to figure out which secu…
As another mentioned further down, no one is simply going around busting up 256bit keys, and when it finally happens, it will be with a computational paradigm that will require a defense built to an entirely different set of requirements: out of the scope of this competition.
Re: What is going on with NIST’s SHA-3?
#43Can someone fix the title? SHA3 is not an encryption standard.
I've long since given up trying to give meaningful titles to Hacker News posts since the anonymous silent moderators rewrite them. The blog post I linked is titled "What the heck is going on with NIST’s cryptographic standard, SHA-3?" and that's the title I went with, saving the trouble of someone rewriting it without notification. But they rewrote it anyway. The title I would have chosen is "NIST's ability to do cry…
.../2409what-heck-going-nist%E2%80%99s-encryption-standard-sha-3
Re: What is going on with NIST’s SHA-3?
#44Earlier quoted context omitted.
Yeah I can't understand why everyone wants "fast" so badly. Something which deliberately can't be made fast is the way to ensure security. I don't really care if my SSL negotiation takes an extra 1ms or if my purchases on Amazon cost an extra $0.001 each because of the expense of the hash functions. I'd like security, thanks. When the price is so trivial, who really cares if it's 10x as expensive?
Because there are a lot of ways to make a fast thing slow in cases where "slow" improves security. And at the same thing you're not hurting performance in cases where a slow function doesn't significantly help security and performance might be important. Making your hash function twice as slow means you've halved the number of hash operations you can perform with fixed computational power. On the other hand, in many…
Re: What is going on with NIST’s SHA-3?
#45This does of course not mean that he made backdoors in AES and Keccak for the NSA. If that were the case he probably would not be allowed to speak about it, and he did talk about it very non-chalantly.
Re: What is going on with NIST’s SHA-3?
#46Earlier quoted context omitted.
> the collision and preimage resistances are the same. > The idea of a hash function which outputs 256 bits having only 128 bits of preimage resistance is unprecedented. But does the SHA-3 construction mean a collision attack will further enable a preimage attack? Most breaks in recent cryptographic hashes have been confined to collision attacks. Even MD5 (publicly) hasn't been shown to be vulnerable to a viable prei…
Its deeply troublesome when these kinds of comments come up for two reasons: first and lesser: its wrong; secondly: its inconspicuously wrong. Processor speeds double approximately every generation which we can estimate is once every two years. What do we have to count to: 2^128 = 3.402823669209385e+38 How many times can we count in a year with a 3GHz core: 3e9 * 3600 * 24 * 365.24 = 9.4670208e+16 In two years, when…
If the world had access to that kind of energy, I'm sure it'd be used for far more interesting things than finding a single hash collision.
[1] http://en.wikipedia.org/wiki/Landauer_limit [2] http://en.wikipedia.org/wiki/Brute-force_attack#Theoretical_...
Edit: and while we're on the subject of inappropriately extrapolating Moore's law, if current performance-per-watt continues to double every 18 months I'd be interested in how long it'd take to even reach the Landauer limit. I can't seem to find out how much energy it takes to do a single bit flip in a modern processor online, so I can't do the calculation.
Re: What is going on with NIST’s SHA-3?
#47Earlier quoted context omitted.
I agree that it's a new design decision, but I think there is reasonable support for making it. Hash function history has pretty well demonstrated that most implementers don't understand the difference between pre-image security, hash output length and collision resistance. And the security margin is far from eliminated entirely. Not only is there significant margin in the round function itself over the full number o…
> SHA-3-512 truncated to 20 bytes of output At this point, your fellow software developers are pointing and laughing at you for "inventing your own cryptography". Your function doesn't come standard in any library. Every single 3rd party audit of your architecture raises a red flag about this and you have trouble finding any official documentation to back you up. (Ask me how I know about this :-) I'm not trying to sa…
Re: What is going on with NIST’s SHA-3?
#48Earlier quoted context omitted.
Yea: s/encryption/hash function/ 'encryption' -> 'hash function' for those that dont grok sed
Right, but it is a cryptographic hash, so presumably it would be better to call it a "cryptographic standard."
The title was fixed.
Re: What is going on with NIST’s SHA-3?
#49Can someone fix the title? SHA3 is not an encryption standard.
I've long since given up trying to give meaningful titles to Hacker News posts since the anonymous silent moderators rewrite them. The blog post I linked is titled "What the heck is going on with NIST’s cryptographic standard, SHA-3?" and that's the title I went with, saving the trouble of someone rewriting it without notification. But they rewrote it anyway. The title I would have chosen is "NIST's ability to do cry…
Re: What is going on with NIST’s SHA-3?
#50Earlier quoted context omitted.
> SHA-3-512 truncated to 20 bytes of output At this point, your fellow software developers are pointing and laughing at you for "inventing your own cryptography". Your function doesn't come standard in any library. Every single 3rd party audit of your architecture raises a red flag about this and you have trouble finding any official documentation to back you up. (Ask me how I know about this :-) I'm not trying to sa…
Don't forget that NIST has mentioned they'll standardize variable-output-length SHA3: SHAKE512 with 20 byte output would be perfectly fine. They've also mentioned they might include MAC and AEAD standards, so I'm not convinced the situation is as bad as you make it.