[Cryptography] What if

[Ryan Carboni]

What if there was a way for a quantum computer to search a mathematical
group?

What if that was the true reason that SHA-3 required 512-bit security? (it
is for lack of imagination that people look at strange things and say, that
is normal)

It gets baffling. But the DES competition asked for ciphers immune to
differential cryptanalysis without saying so, which was the most
significant thing about the DES competition.

Afterall, 1600-bit state is a bit... large. But given that the group size
for DES is somewhere in the hundreds or thousands, Keccak would have a
group size in the millions, certainly.  (not that there weren't other SHA-3
finalists with large internal states)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20170812/106fb01f/attachment.html>