Discrete logarithm problem in Z\pZ

I am trying to solve a discrete logarithm problem in Z\pZ to crack a weak communication protocol for a computer security course. I need to find x, such that: g^x (mod p) = t g, p and t are known. p - large prime number (p = 2q+1, where q is also prime). All arithmetic is done in modulo p. g - a generator modulo N t - target x - the unknown There are 2 problems: one where p is on 128 bits and one where p is on 256 bits. Problem 1: p = 267065439997650404472387033028200164123 g = 5 t = 25130515985127073564283683038001419893 Problem 2: p = 92293534103599619349883189593276522710135442872030350795164592158992562582659 g = 5 t = 374929204365249147282639839057012770138606373778043481913846700622299475288 I've tried using GDLOG software with no success. I need someone to guide me to solve both problems, show me which software to use and explain in detail the steps needed to find x with the respective software on my computer (Linux or Windows).