Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?

We show that an algorithm implementing the Binary-Field Arithmetic operation of multiplicative inversion exists as a purely functional term which is typeable in Dual Light Affine Logic (DLAL). As a consequence, the set ΛDLAL of functional terms typeable in DLAL is large enough to program the whole set of arithmetic operations. Second, and most important, we show that ΛDLAL can be seen a domain specific language that forces programmer to think about algorithms under a non standard mental pattern which may result in more essential descriptions of known algorithms which, also, may be more efficient.