We propose new multivariate cryptosystems over n-dimensional vector space over a finite field Fq based on idea of hidden discrete logarithm problem for F ∗ q. These cryptosystems are based on hidden eulerian equations x = a, (α, q − 1) = 1. The method is based on the idea of Eulerian transformations, which allow us to use asymmetric algorithms based on families of nonlinear multiplicatively inj...