**Type Name:**`FF`**Description:**- The implementation of finite fields is not ``complete'' in the sense
that it does not comprise the general case of finite fields of order
but only the case of finite fields of order
*p*, namely (*p*prime). We choose as representation for . Thus, elements of a finite field are represented as positive integers and arithmetic is done modulo a prime number, which is stored in the global variable`modulus_`. Modular arithmetic is used from SACLIB.

Thu Sep 3 14:50:07 MDT 1998