There is a constructive method to define a structure of simple k-cyclic Post algebra of order p, L p,k , on a given finite field F (p k ), and conversely. There exists an interpretation Φ1 of the variety V(L p,k ) generated by L p,k into the variety V(F (p k )) generated by F (p k ) and an interpretation Φ2 of V(F (p k )) into V(L p,k ) such that Φ2Φ1(B) = B for every B ∈ V(L p,k ) and Φ1Φ2(R) = R for every R ∈ V(F (p k )).In this paper we show how we can solve an algebraic system of equations over an arbitrary cyclic Post algebra of order p, p prime, using the above interpretation, Gröbner bases and algorithms programmed in Maple.