Linked by Thom Holwerda on Fri 23rd Sep 2011 22:22 UTC, submitted by kragil
Thread beginning with comment 490881
To view parent comment, click here.
To read all comments associated with this story, please click here.
To view parent comment, click here.
To read all comments associated with this story, please click here.
News
Linked by Thom Holwerda on 05/22/13 22:23 UTC
Linked by Thom Holwerda on 05/22/13 13:38 UTC
Linked by Thom Holwerda on 05/22/13 13:30 UTC, submitted by JRepin
Linked by Thom Holwerda on 05/21/13 22:06 UTC
Linked by Thom Holwerda on 05/21/13 21:45 UTC
Linked by Thom Holwerda on 05/21/13 15:53 UTC
Linked by Thom Holwerda on 05/20/13 22:43 UTC
Linked by Thom Holwerda on 05/20/13 21:50 UTC
Linked by Thom Holwerda on 05/19/13 23:15 UTC
Linked by Thom Holwerda on 05/19/13 23:11 UTC, submitted by Drumhellar
More News »
Sponsored Links



Member since:
2011-01-28
Neolander,
"So when calculating a hash, a function that's relatively easy to reverse in itself is typically applied a large number of times on the incoming data"
I can't say for sure that this is true of all hash functions, but it is of the SHA variants (and many block ciphers as well). Keep in mind that a major design goals for these functions is that they run well on ordinary 32bit CPUs where it'd be relatively difficult to achieve sufficient diffusion using standard opcodes in one pass.
"Just need to get used to a new form of logic (I think I've read somewhere that quantum computers cannot compute operations which destroy information, like AND or OR, and thus require use of new logic gates and reasoning)."
Yep, that's the stuff I need to learn about. I have no excuse not to learn it (other than time).
[deleted rambling personal story]