Topic: Point dividing examples (Read 124 times)
If someone know how to minimise numbers of pubkeys - lets talk about this.
Use ecctools for this. in this ex dividing 2^60 pubkey:
Enother code make 82 from 120 bit
You need find shitnumber and shit numbers with many pabkey or another method.
Use a inversion of 2^94 as a basepoint:
output:
new priv is a divided priv - range 2^82, priv - 2^120.
Code:
priv 0x953f49ae70ed676 2**60
953ec9ac70ed676
753f49ae70ed676
/ 0x20000000 = dcf2e84ffffffffffffffffffffffffee73997ebdf8a334b693c56a1461840e7
- 1 - 0x4000 =
dcf2e84ffffffffffffffffffffffffee73997ebdf8a334b693c56a1461800e6
pub = 0217e6a9925b659b97394039c7f355150a7be9f3adcf797bc5681f8584af0a69a6
- -_-------_---
2**29:
0x20000000
inv (2**29)
=
ac4589f7ffffffffffffffffffffffff25151e38f58f7d8301173ec3803d864e
G replace your basepoint to this basepoint:
02:
590670df6004cc1f1d1dda2f08a1045b77349c40409a63187336705ec5f292e4
04:
590670df6004cc1f1d1dda2f08a1045b77349c40409a63187336705ec5f292e4
b3f7df737c4ee700fd1ab386939343d70227b48df0e7ba438549695e30ea7578
Enother code make 82 from 120 bit
You need find shitnumber and shit numbers with many pabkey or another method.
Use a inversion of 2^94 as a basepoint:
Code:
#modofy this code for work with publick key, it is easy.
N = 115792089237316195423570985008687907852837564279074904382605163141518161494337
def inv(v): return pow(v, N-2, N)
def divnum(a, b): return ( (a * inv(b) ) % N )
shitnum2= 0#2**10#2**10#*4275#219788
priv=0xa333d84649e1afa9c17a74c04f6c32 #- (0x634adc*2**56)#2***70
#-5-0x7962e67f4ee462dbb2d11009e66
#-7 x 0xe5a300a670ed5ab8dce16c1530e
#0x1ceba4b7b228839f71ed9af 2^00
#######0211220xa333d84649e1afa9c17a74c04f6c32=0x2fe0a51aefdd932cbce3d - 2^94
0x378fc97ca23fd4356c48969
0x246aab53748a772e927d3023efbb#Pr 0xa333d84649e1afa9c17a74c04f6c32
x =0
shitnim = 42782561
while shitnum2 < shitnim:
#priv = (priv - x ) % N
#print("pr",hex(priv))
#priv1 = priv
s =(divnum(priv,2**94)-(shitnim)) %N# -
d = (divnum(shitnum2,2**94)) %N
#if d > priv:
#print(hex(d-priv % N))# +divnum(2**15,2**10)
#x = d * 2**22 % N
x = divnum(s,d)
y= d * shitnum2
#print("y",hex(y))
df = (s - y )% N
if x <2**82and x >= 0:
print("New Priv x",hex(x),"d",hex(d),hex(df),"s",hex(s),"shitnum2",(shitnum2),"shit num", shitnim, "priv",hex(priv))
shitnum2 = shitnum2 +1
output:
new priv is a divided priv - range 2^82, priv - 2^120.
Code:
New Priv x 0x0 d 0x0 0xf5276388fc753af147a8c937fffffffec8774b8ff866ee36d7ce9d94048a1428 s 0xf5276388fc753af147a8c937fffffffec8774b8ff866ee36d7ce9d94048a1428 shitnum2 0 shit num 42782561 priv 0xa333d84649e1afa9c17a74c04f6c32
New Priv x 0x2fe0a51aefdd932cbce3d d 0x3ae91116edaaf43f0511f997ffffffffb523717bcb58ef1d19526deb96fa6345 0x27597959832fee809fe23fc7ffffffffcdfef03cd76567c4caa70a20c466cf61 s 0xf5276388fc753af147a8c937fffffffec8774b8ff866ee36d7ce9d94048a1428 shitnum2 538 shit num 42782561 priv 0xa333d84649e1afa9c17a74c04f6c32
Jump to: