Hi... I know, it's crazy to think we can brute force a 32 alphanumeric random key first off... but lets just take it as an ambitious project from the coding standpoint and lets give the community a chance to get lucky for once.
I've been working now for some days on a program which would try to brute force a PKG passcode.. Of course this would take billions of years on just a single person's hardware, but still i had the ridiculous idea of making this happen.
Using Maxton's liborbis github project i managed to make use of his PKG passcode checking module and hit it with the different possibilities we randomly create.
Well the possible results are ridiculously big and so i had to make my own numeric base based on the possible characters on a passcode (as a ulong isn't even big enough to store the number of possibilities) and also give the capability to split up Guessing "Regions" let's call them which are composed of all the possibilities between two pascodes.
My intention is to run a web service which would feed users a Guess "Region" which they use their own hardware to check and return to the server if any of the keys inside decrypts the package.
Yes it's nuts and we won't actually get any results... i think, but here's where i needed some help.
What if we give users a random Guess Region from wherever inside the possibilities.
This would make sure at least random regions of passcode will get checked without having to go through for example the filled with 0 keys which is difficult to think would actually be right but without skipping too many possibilities.
A problem with that is of course keeping in memory on the server the checked regions, which would also take up unstorable amounts of bytes.
Ok so ignoring the fact that this is ridiculous , anyone interested in the idea?
Anyone knows any way we can actually try that "random" handing of Guessing Regions?
I've been working now for some days on a program which would try to brute force a PKG passcode.. Of course this would take billions of years on just a single person's hardware, but still i had the ridiculous idea of making this happen.
Using Maxton's liborbis github project i managed to make use of his PKG passcode checking module and hit it with the different possibilities we randomly create.
Well the possible results are ridiculously big and so i had to make my own numeric base based on the possible characters on a passcode (as a ulong isn't even big enough to store the number of possibilities) and also give the capability to split up Guessing "Regions" let's call them which are composed of all the possibilities between two pascodes.
My intention is to run a web service which would feed users a Guess "Region" which they use their own hardware to check and return to the server if any of the keys inside decrypts the package.
Yes it's nuts and we won't actually get any results... i think, but here's where i needed some help.
What if we give users a random Guess Region from wherever inside the possibilities.
This would make sure at least random regions of passcode will get checked without having to go through for example the filled with 0 keys which is difficult to think would actually be right but without skipping too many possibilities.
A problem with that is of course keeping in memory on the server the checked regions, which would also take up unstorable amounts of bytes.
Ok so ignoring the fact that this is ridiculous , anyone interested in the idea?
Anyone knows any way we can actually try that "random" handing of Guessing Regions?
It really is a lot of possibilities, we're talking 3.5239301069114412073117519984402e+60 if we only depend on alphanumeric characters with common puntuation. We won't be able to store that amount of strings in any kind of memory capacity nowadays . That's why in my model the server just contains a string with the last verified checked key and sends the next region to miners.