Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
3
Newest
 Announcer
Impact
~2k people reached

  • 0 posts edited
  • 0 helpful flags
  • 1 vote cast
Jan
7
comment Hash function that allows to decide if A > B if you only have hash(A) and hash(B)?
This does assume a full ordering of the input domain, though. If the number of equivalence classes is no more than the number of possible outputs, then the pigeon hole principle does not hold. But here it's given that A and B are integers, where the number of equivalence classes is (literally!) infinite.
Nov
13
awarded  Announcer
Nov
11
comment Why can't I reverse a hash to a possible input?
And note that cryptographic hashes are designed to have a high degree of mixing, which is necessarily achieved by designing circuits with high fan-out.
Jun
7
awarded  Supporter
Jun
7
comment How do we know a cryptographic primitive won't fail suddenly?
@user3491648: You're clearly unhappy with this answer, but that doesn't make it in any way wrong. Basic logic dictates that statement like these do not require proof, as such proof is generally impossible and yet they're refuted by a single counter-example (In this case, such a counter-example would have the form "we know because X").
Mar
13
awarded  Teacher
Mar
13
answered Are there use cases where a signature itself needs to be signed?
Mar
13
answered Why does SHA-1 have 80 rounds?
Aug
16
comment Voting scheme where the votes become public when a threshold is reached
@mikeazo: Under the weak assumption of secret voting, your observation does prove that you can't have any further votes. But this is no issue e.g. when the threshold is set to 51% of voters.
Jan
9
comment Is it possible to create an easy to use encryption/decryption method that will never be comprimised?
Actually, there's an infinite set of ciphers that are cannot be broken, but they all share the 4 points you list. Trivially, for any bijective function f, f(OTP(x)) is such a cipher.