In here we are aliens with passwords, we only  work with public keys, you could post it here so we could check it out ( not making any difference, because we are stuck with keys smaller than 160 bit ).

Have you tried hashcat yet?
Regarding pollard's method aka kangaroo, you could divide your public key by 2 but before that either add 1G or subtract 1G then you'll have 2 public keys, original and it's +1, you could divide them both by 2 four times in a row, then add 1G to each result and divide all of them by 2, at the end you will have millions of keys, which would be impossible to do the division and addition manually you'd need a program to do that which doesn't exist, but if you could do that then for example you could divide n of secpk1 by 2 as many times as you divided your public key and input those millions/ billions of offsets into kangaroo and then use n/2, n/4, n/8 etc as your start range, you could subtract an estimated number from your n/2 and use it as start and add that estimated number to n/2 and use it as end range, I'd imagine you'll have to try at least 200 start/end ranges one by one and spend at least 6 hours for each search.

Wish you find your coins, good luck.