The isomorphism of polynomials (IP), one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials. Then the enumeration problem of IP consists of counting the numbers of different

The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study the counting problem associated to IP. Namely, we present tools of finite