Layman here. I don't completely understand what I am talking about or how to articulate it.
Could we make brute forcing of SHA-2 easier by making a formula that discounts all easily "guessable" private keys? For instance we could disregard a key that is all 0s or all 1s or all 2s and so on, I hope you get it. You may think, well that only eliminates 10 keys out of 2^256! Someone who could maybe do math could take that a little further. Eliminate all keys that consists of half of one integer and half of another. That eliminates some more! And then we could eliminate sequential keys like 121212.. or 23232323....
If we could think of enough easily "guessable" keys to eliminate and after determining what consists of a "guessable" key, could we possibly find a significant number of keys? Maybe even halve our number of total private keys that we would have to brute force.
I guess this comes down to defining what randomness is in this number set and how to actually describe that.
Could we make brute forcing of SHA-2 easier by making a formula that discounts all easily "guessable" private keys? For instance we could disregard a key that is all 0s or all 1s or all 2s and so on, I hope you get it. You may think, well that only eliminates 10 keys out of 2^256! Someone who could maybe do math could take that a little further. Eliminate all keys that consists of half of one integer and half of another. That eliminates some more! And then we could eliminate sequential keys like 121212.. or 23232323....
If we could think of enough easily "guessable" keys to eliminate and after determining what consists of a "guessable" key, could we possibly find a significant number of keys? Maybe even halve our number of total private keys that we would have to brute force.
I guess this comes down to defining what randomness is in this number set and how to actually describe that.
