In all the articles and research papers I have read, well most of them, they talk about subgroups. Can this not be done?
Example, if we are trying to solve a key for the range 10000:1FFFF, currently we can only use the exact range started with for the same key. Can we not setup hash and jump table for 10000:1FFFF (precomp of sorts) and then attack the range with different starting points?
Example:
1 - 10000:1FFFF
2 - 11000:1FFFF
3- 12000:1FFFF
....
10- 1A000-1FFFF
or attack in smaller bits such as
100FF-1100
101FF-1200
etc?
My PC alone can solve 64 bit in 1 minute...what if we randomly generate 64 bit (or whatever bit number desired) inside the larger bit range and use the
-m option to stop the search in this section and move to the next randomly generated 64 bit piece. or better yet, make it a sequential 64 bit search inside of a 110 bit range. With numerous GPUs, you could assign each one a different range so the sequential piece is sped up.
Example:
gpu 1- attacking 10000-11000 in smaller sequential bits
gpu 2- attacking 11001-12000 in smaller sequential bits
etc
Anyone, thoughts?
I think if you fined key in 64 bit, you not need next 64 bit, but if you fined only on 3*64 bits false and after only 1 BINGO 64 bit, this is I think not = 256 bytes key and fourth 64 bits with private key will be not 256 bytes key too.........
the 64 bit doesn't need to equal anything...
it could be a sequential 40, 41, 42, 50, 56, 72, 80, etc bit range. The object is to check the smaller ranges (subgroups?) inside a larger range for the same key.