Tobias Kienzler
Reputation
Top tag
Next privilege 250 Rep.
 Dec 24 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” I started implementing this: github.com/zommuter/zomtems Dec 23 comment Why is elliptic curve cryptography not widely used, compared to RSA? @Xeoncross You might be interested in this quetsion Jul 23 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” Silly me, of course! Aren't your keys rather salts (or even peppers)? What is their purpose, couldn't one do without them? Jul 21 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” Can't one simply hash all items individually and then hash the sum of all hashes? And then, in order to prove a certain item's presence, provide its hash and that of the sum of all other hashes, and the sum of these two again hashes to revealed hash? On second thought, hashing the sum wouldn't do any good; why not simply sum all items' hashes? Jul 21 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” I wasn't exactly sure what your k and i meant, and what your two-argument hash is, so I interpreted it from this Wikipedia image. But I think I didn't actually grasp your idea, maybe you could add a picture or example at some point - why are keys required? Jul 4 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” Interesting method, though the growth means you'd have to add dummy items to not give away the amount of items packed Jul 4 revised I hashed my bag and in it I put… “Is there a hash for unordered items?” deleted 12 characters in body Jul 4 accepted I hashed my bag and in it I put… “Is there a hash for unordered items?” Jul 2 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” @cygnusv Hm, let me think about this... Commutativity would yield easy collisions, so the inner hash should be a "proper" one instead, right? But then again, if I understood it correctly those collisions are very peculiar and, given strings, would mostly yield garbage words. But still, sha512 for the items themselves wouldn't hurt... Jul 2 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” Yes, on second thought #3 seems irrelevant, since H(bag without I) is simple H(other, items, etc) Jul 2 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” You mean a Merkle tree? Yes, apart from 3 which on second thought seems irrelevant that does sound like a match, thanks - if one uses addition instead of concatenation Jul 2 revised I hashed my bag and in it I put… “Is there a hash for unordered items?” added 180 characters in body Jul 2 comment I hashed my bag and in it I put… “Is there a hash for unordered items?” @cygnusv Because of "chainable"? I understand it would be insecure if H(H(A))=H(A), but what I (maybe unfortunately) called chainability merely allows splitting the hashes, and come to think of it is not even necessary Jul 2 asked I hashed my bag and in it I put… “Is there a hash for unordered items?” Feb 16 asked Is there a method to combine encryption and ring signing? Dec 5 comment At the current time, is SHA256 the de facto standard for strong cryptographic hashes? Question about the previous comment: “Weaknesses” in SHA-256d? Sep 15 awarded Informed Sep 11 awarded Excavator Sep 11 revised How do you find a cheater in Shamir Secret Sharing? fixed logic Sep 11 accepted Is a continuous stream of encrypted data embedded in garbage more or less secure than only encrypting the data?