Reputation
Top tag
Next privilege 150 Rep.
Create new tags
Badges
6
Newest
 Curious
Impact
~300 people reached

  • 0 posts edited
  • 0 helpful flags
  • 10 votes cast
19h
comment Secure content-defined chunking
Looking at the Blake2s and Blake2sp, there is no way for them to be faster than SipHash simply by comparing the amount of computation done per round and the number of rounds (2 vs 10), unless I would target 16-core processors, in which case the parallel computation might begin to catch up. SipHash and Blake2 were both made by Jean-Philippe Aumasson, and SipHash was specifically designed for hashing short messages unlike Blake2. Also, Blake2s is not available for my platform (C#).
Jun
18
accepted Why does UMAC encrypt the output of universal hash function?
Jun
18
comment Why does UMAC encrypt the output of universal hash function?
Just to supplement this answer, the $(k_1 - A) \cdot (k_2 - B) + M$ seems to come from the NH hash family construction (page 19).
Jun
16
comment HKDF entropy extraction
I could never do that, you deserve all the rep. My answer would not provide any additional information, just rephrase yours a bit (90% copy & paste).
Jun
16
comment HKDF entropy extraction
I have proposed an "edit" for this answer but was rejected. For that reason, I have to state here that I accepted the answer because of the "yes it is secure" statement and the hint that CSPRNG is yet another option to use. I do not agree with the rest of the first paragraph, but apparently random people who rejected my edit know better.
Jun
16
accepted Post-quantum authenticated encryption
Jun
16
comment Post-quantum authenticated encryption
Thanks for your answer. Actually when writing my question, I was kinda worried whether the math that's behind some of these MACs can't be attacked by quantum computers, since many use primes in some way. GHASH in GCM already has some problems, so I thought that maybe these can lead to real problems with quantum computers.
Jun
15
accepted HKDF entropy extraction
Jun
15
suggested rejected edit on HKDF entropy extraction
Jun
14
awarded  Curious
Jun
13
asked Why does UMAC encrypt the output of universal hash function?
Jun
13
comment Secure content-defined chunking
@SOJPM: Thanks, I will check it out. But after a quick investigation of the SipHash paper, they compared SipHash to BLAKE-512, and SipHash turned out to be 5.5 times faster than BLAKE-512 for 64 byte messages (BLAKE-512 has 16 rounds vs 2 rounds of SipHash). I wonder if Blake2sp improves the situation so much on 32-bit platforms as to get ahead in terms of performance.
Jun
6
awarded  Scholar
Jun
6
accepted Cryptanalysis of Marvin32
Jun
6
comment Cryptanalysis of Marvin32
Thanks for the answer. The second part seems really bad, as it's pretty much an invitation for someone to find collisions in Marvin32 just like they did in MurmurHash. I guess the good part is that Marvin32 is internal in .NET framework, so they can just replace it with something that works once it gets broken.
Jun
5
asked Cryptanalysis of Marvin32
Jun
4
revised Secure content-defined chunking
added 140 characters in body
Jun
3
revised Secure content-defined chunking
added 153 characters in body
Jun
3
asked Secure content-defined chunking
May
27
awarded  Commentator