[Resource Topic] 2017/093: On new multivariate cryptosystems based on hidden Eulerian equations over finite fields

Welcome to the resource topic for 2017/093

Title:
On new multivariate cryptosystems based on hidden Eulerian equations over finite fields

Authors: Vasyl Ustimenko

Abstract:

We propose new multivariate cryptosystems over n-dimensional vector space over a finite field F_q based on idea of hidden discrete logarithm problem for {F^*}_q. These cryptosystems are based on hidden eulerian equations x^{\alpha}=a, (\alpha, 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 injective maps of prescribed polynomial density and flexible degree.

ePrint: https://eprint.iacr.org/2017/093

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .