@eniko girl when you figure it out can I get a slice of that pie too
M
mrl314@peoplemaking.games
@mrl314@peoplemaking.games
Posts
-
hey fellow gamedevs how do i internalize that "thinking about game systems and fixing problems in my head" isn't idle time but is literally doing the work of game design -
Never let anyone talk you out of a quick 1 week hack.Never let anyone talk you out of a quick 1 week hack. Those 8 months will be the best 6 years making it into a finished product of your life
-
A bit of a weird longshot, but does anyone have any resources on reducing the viable search space of inputs to a polynomial rolling hash where the multiplier is known, and the modulus is just over a 4-byte word?A bit of a weird longshot, but does anyone have any resources on reducing the viable search space of inputs to a polynomial rolling hash where the multiplier is known, and the modulus is just over a 4-byte word?
I’ve given a couple of thoughts to cracking this but I keep hitting hard dead-ends to my knowledge.
Also I must state this isn’t for any actual security breaching, (you shouldn’t be using this kind of hash for anything remotely secure), this is mostly a pet project with a minor application in reverse engineering a few hashed strings in an older game with no reference in the code to the original strings
-
A bit of a weird longshot, but does anyone have any resources on reducing the viable search space of inputs to a polynomial rolling hash where the multiplier is known, and the modulus is just over a 4-byte word?For those more curious, the rolling part of the hash is:
h_i = s_i + h_i-1 * 31
over an int32My current approach was to try to find a lattice basis for
KNOWN_HASH = sum(0<=k<n, s_i * 31^(n-1 - k)) mod 2^32 where n = length of string s
and then run some brutes over that search space since it’ll likely be significantly smaller than just regular brutingHowever I’m both very interested in the math, and I don’t want to chug my computer on the problem more than I need to