Professional Documents
Culture Documents
TRICK
TRICK
TRICK
x = 0x00000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63,
y = 0xc0c686408d517dfd67c2367651380d00d126e4229631fd03f8ff35eef1a61e3c
draw a random u
Usually point addition is more costly than point doubling, and it might be better
to use:
draw a random u
in [1,n)
compute associated point P0=u×G
keep doubling that point, computing Pi=Pi−1+Pi−1
until that's a public key with suitable vanity
find the corresponding private key as 2iumodn
.
Then to find a private key to any public key with a specific m bit prefix, with
m>n/2, Pollard Rho is the best shot, with m≤n/2 the fgrieu method is the best.
3) remove the last 4 bytes from the result and call what's left N -
000A52498DB787B09EEC7C428B8B0C853EA1C2702C4E117611
4) sha256(sha256(N)) -
BD0F89693417148626446F3E1EA43A69453FBCF72A024600FB54A2BC34F23387
done
Code:
vanitygen -k -r ^^123.*321$
This will search for the 123 pattern at the beginning and 321 at the end.
Obviously it doesn't have to be a numerical progression but certainly it will have
to begin and end with a 1