Helou,
Could someone give some coding support for vanitygen (oclvanitygen)?
I'm using oclvanitygen (GPU) with Linux and I could compile a new version from source code.
So I need some advices for my "problem".
When oclvanitygen found ex "1GeGeA" pattern with -k option (Keep pattern and continue search after finding a match), now it's generate a new random seed and start again from different point.
I need to modify the source code that way, when it found a pattern, it does not generate a random seed value, only increase X value amount to "secret exponent value". So the starting point is quite near the previous one (diff X).
---snip ----
Could someone please give piece of code for me? I'm quite noob to code.
I have look the source code, but it's quite difficult to understand.
Thank you very much!
I Guess what you are looking for kind of kills the purpose of the ECDSA algorithm.
The algorithms to find ECSDA points for addition and multiplications are not so straightforward to find points that are 'close'.
The result is also hashed with SHA256, creating a big change in the result for each minor change.
All the code you need for your problem is available, its called vanitygen, unfortunately >99% of the solutions/time is waisted.......