Some algorithms over finite fields

We present the design and the analysis of two algorithms over finite fields: the first one determining elements of large multiplicative order in any finite field with no constrain on cardinality or characteristic, while the second one is probabilistic and it computes with high probability the greatest common divisor of several polynomials using only one pairwise gcd computation.