klogic

3 ms·

1. 1.▲
   Faster Poly1305 Key Multicollisions(kryptoslogic.com)

   2 points by klogic 6y ago|0 comments
2. 2.▲
   ZeroAccess 3 Analysis(kryptoslogic.blogspot.com)

   1 points by klogic 11y ago|0 comments
3. 3.▲
   Complexity is the bugdoor's friend(kryptoslogic.blogspot.com)

   28 points by klogic 12y ago|0 comments
4. 4.▲
   by klogic 12y ago

   The proof is implicitly modulo 2^96, which I believed to be the intention of the original code, but it does miss a possible overflow when c is too large, which shouldn't happen in its intended use: c2 is already meant to be the overflo