Quote from: kTimesG on Today at 07:39:28 PM

Quote from: farou9 on Today at 07:11:59 PM

we are not subtracting the target we are subtracting from the target. Ps(Strat range) Pt(traget) pb(point of scalar 1billion).
PS +Pb =Q , Pt + (-Q)=R , then we look for x of R in Db .
What do you mean by "the target point needs to get subtracted in sqrt(rangeSize) delta increments".
I know this strategy can't help much with 135bit , that is why I have another approach with that Db

It's faster to simply do Pt - j*Pb = R and look for x in the precomputed [startRange, startRange + 1 billion] table.

This is basically how BSGS works.

If the private key is beyond 58 bits this gets exponentially more inefficient, the larger the range is.

For 135 bits you'd need a 2**67 database and 2**67 subtraction & lookup steps. But due to space and time constraints this is not possible for the foreseeable future (e.g. our lifetime).

what is j* here and why are we storing {ps+pb , ps+2pb......}.

My method is to start with that dB in hands then take ps+pr(random scalar pub key between {1...2^133})=R then pt+(-pr)=Q
Then Q + (-R)=T then look for X,T in dB if not found we store that x of PR and its scalar then take another random scalar , if random scalars sum reach 2^133 we restart from orginal