j is the loop index, from 1 to 1 billion or until you find the key. Maybe you should first familiarize with BSGS basic concepts, you seem to want to double the number of operations for no reason.

Sorry but your 135 algorithm is nothing more than basically a linear search, which is like the worst possible way of searching. It already is a huge, huge task to do 2**68 operations using something like Kangaroo to solve it, your strategy runs in 2**109 steps or so, which is like 1 trillion times slower.

[quote]div> so j is how many billion until we reach the tp ,actually we both know not bags nor kangaroo can help with my cpy , unless I invent something new that work I am not gonna get anything except for wasting my time.

Not exactly linear ,its random

j is the loop index, from 1 to 1 billion or until you find the key. Maybe you should first familiarize with BSGS basic concepts, you seem to want to double the number of operations for no reason.

Sorry but your 135 algorithm is nothing more than basically a linear search, which is like the worst possible way of searching. It already is a huge, huge task to do 2**68 operations using something like Kangaroo to solve it, your strategy runs in 2**109 steps or so, which is like 1 trillion times slower.

[/quote] so j is how many billion until we reach the tp ,actually we both know not bags nor kangaroo can help with my cpy , unless I invent something new that work I am not gonna get anything except for wasting my time.

Not exactly linear ,its random