There is a constructive method to define a structure of simple k-cyclic Post algebra of order p, L p,κ, on a given finite field F, and conversely. There exists an interpretation Ф₁ of the variety V generated by L p,κ into the variety V) generated by F and an interpretation Ф₂ of V) into V such that Ф₂Ф₁ = B for every B ϵ V and Ф₁₂ = R for every R ϵ V). 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. (shrink)