Finite algebras in the design of multivariate cryptography algorithms

A new approach to the design of multivariate public-key cryptalgorithms is introduced. It envisages using non-linear mappings defined as squaring and cubic operations in finite fields represented as finite algebras. The developed approach allows significant reduction of the size of public key and thereby make post-quantum algorithms of multivariate cryptography much more practical. In the developed algorithms, the secret key includes a set of values of structural constants that determine the modifications of the finite fields used and the coefficients in the set of sixth degree polynomials that make up the public key