3 ms·
Oh shit. I'm just using multiplicative inverses to reverse hash functions. Simply by inverting every expression from bottom to top. https://github.com/rurban/sm
by rurban 6y ago
Oh shit. I'm just using multiplicative inverses to reverse hash functions. Simply by inverting every expression from bottom to top.
https://github.com/rurban/smhasher/tree/inverse/inverse https://github.com/rurban/smhasher/tree/inverse/inverse
Multiplication was the hardest, and several numbers were hardly invertible. OpenSSL has a nice inverter. Could be used to make crypto better.
- dhosek 6y agoOr possibly not. I'm reminded of Sarah Flannery's idea that matrix multiplication might be a good one-way function for crypto. Turned out that in that context, there was a cheap inversion that wasn't immediately obvious. Her memoir/math book about this (and learning mathematical cryptography) co-written with her father is a good introduction to a lot of mathematical cryptography ideas: http://www.amazon.com/exec/obidos/ASIN/1565123778/donhosek http://www.amazon.com/exec/obidos/ASIN/1565123778/donhosek
- deleted 6y ago[deleted]
- amenghra 6y agoInversible hash functions (such as murmur) are only related to cryptographically strong hash functions in that they share the words "hash function".
- zomglings 6y agoThe article is about groups of units in group rings. That seems to have very little to do with your post - am I missing something?