|
PtiT* please.
* - PtiT means Put this into Trash. Officialy invented at discussion " successfully brute forced 149 xtea " on rune-server.ee community forums by Monastyr, the 8 yo kid. Source: Wikipedia
literally nobody cares about the key you have, share how to do it. If you're not lying then we could decrypt the maps from every revision since 400 that we have the resources for, and you will have contributed more to rsps than anyone else in the last 5 years
or you can admit you're bsing and stop wasting our time i guess
actually that isn't true since we can load grab every landscape data as for 764+ without xteas and we do already have access to most (if not all) landscape areas that were changed between those revs. i don't think 1-5 uncommon (and probably never used and therefore removed) regions will be a big contribution
but yeah i also understand that wasn't the point u were trying to make so sorry 4 being edgy
Well there is no bull shitting Major the only thing I am doing is looping through generated keys with some patterns, thats about all. Just having mulitple programs running at the same time with different starts on the keys. Pushing my cloud servers to 100% CPU. That is about the only secret we are doing. You can do it as well for free with Google cloud if you wanted. simple make a few bogus accounts and each account you get $500 credit using their machines. that simple for someone to start. So you pulled it out of me the die hard secret using loops in C# using the openrss by impulser as it was taking 27 seconds per 1 million loops in java where as C# im able to do 1 million loops in ~500ms. Why the performance increase who knows? Don't care. But the only thing I did to try something different then most is thinking well if I have multiple programs running with different start points it would give me an advantage over starting at int.min on 4 differnent loops. basically had quite a few of them running on a few servers and boom we got a hit. doing the same thing right now for easter island and not getting results as fast so could have been lucky.
So again that was the secret sauce. nothing impressive about it just awesome it worked.
What you described is literally the definition of Brute forcing something. If you have to ask for patterns then you didnt read the above statement. so in a simple term for you ill make a simple program in java just so you can have it on the house. Here is your start on the brute force method. I wouldnt suggest using it but here is a program you can have fun with
Code:int a = b = c = d = Integer.MIN for(;;) { a++: for(;;) { b++; for(;;) { c++; for(;;) { d++; //decrypt } } } }
btw, it's just as likely for all four parts of the key to be Integer.MIN_VALUE as any other four values - the whole point of random numbers is that they're uniformly distributed.
Again... what are these elusive "patterns" that you seem so reluctant to explain?
Assuming 1 loop == decryption of 1 XTEA block, that's 5x slower than estimate in my first post, so it'd take even longer!
Okay, let's say you used 1 million servers - almost certainly an over-estimate, but I'll be generous. That'd shave the expected time to brute force a single key down to 1*10^18 years (and that's if you use the 5x faster C implementation used in my original calculations). Still completely infeasible.
« Previous Thread | Next Thread » |
Thread Information |
Users Browsing this ThreadThere are currently 1 users browsing this thread. (0 members and 1 guests) |