These files are for the benchmark GCD computation in K[x] where 
K = Q(alpha1,alpha2,alpha2,alpha3) in the paper in Monagan.pdf.
The code constructs Lp = K mod p and then runs the GCD computation over Lp.
In the paper this is done for the two primes p = 2^25-855 and p = 2^62-923 .
I've included the code used to generate the timings for 
Pari, Magma and Maple and their output in the files

gcd.pari   Pari code
out.pari   Pari output
gcd.maple  Maple code
out.maple  Maple output
gcd.magma  Magma code
out.magma  Magma output