Extension of RSA crypto-structure: a Galois approach

The Euler totient function and Euler-Fermat theorem utilised in the RSA scheme are extended from the integers to polynomials over finite fields. The new scheme is suited for both privacy and authentication implementations, as is its predecessor. The security of the system rests in part on the difficulty of determining the degrees of the irreducible factors of a high-degree polynomial.