News for hackers. Stuff that matters.
Re:Did NSA Put a Secret Backdoor in New Encryption Standard?... by Dylan16807 on Thursday September 05, 2013 @10:16PM (#6338327)
Why not? It's designed for indefinite output.
Re:Did NSA Put a Secret Backdoor in New Encryption Standard?... by maaku on Friday September 06, 2013 @04:15AM (#6339258)
Are you trolling?
Re:Did NSA Put a Secret Backdoor in New Encryption Standard?... by jared314 on Friday September 06, 2013 @01:19PM (#6341506)
I think he is trolling, with just enough information to sound correct. The Keccak authors have proposed a "duplex construction"[1][2], using the arbitrary length inputs/outputs and the lack of a output transformation in the sponge construction, that could be used for authenticated encryption. The NIST has yet to included that use case in the SHA-3 standard. So, until there is enough solid understanding for its correct use and tested implementations with that use, it is just a hash function.

[1] http://sponge.noekeon.org/ (end of the page)

[2] http://sponge.noekeon.org/SpongeDuplex.pdf

Re:Did NSA Put a Secret Backdoor in New Encryption Standard?... by Dylan16807 on Friday September 06, 2013 @01:28PM (#6341559)
> So, until there is enough solid understanding for its correct use and tested implementations with that use, it is just a hash function.

I don't understand the logic here. Isn't the use of Keccak as a hash function currently largely-untested too? I would think you'd avoid using it at all in a production system right now, but if you're willing to use the algorithm why not use all of its capabilities?

And I'm not trolling.

Re:Did NSA Put a Secret Backdoor in New Encryption Standard?... by Dylan16807 on Friday September 06, 2013 @01:17PM (#6341497)
...no

Keccak is a generic construction suitable for more than just hashing. Here, let me copy the first bullet point off their site.

> As a sponge function, Keccak has arbitrary output length. This allows to simplify modes of use where dedicated constructions would be needed for fixed-output-length hash functions. It can be natively used for, e.g., hashing, full domain hashing, randomized hashing, stream encryption, MAC computation. In addition, the arbitrary output length makes it suitable for tree hashing.

Note that Keccak has a significant amount of hidden state, and they proved that the sponge construction itself is secure as a function of how many bits are hidden.