Welcome to the resource topic for
**2023/738**

**Title:**

Extremal algebraic graphs, quadratic multivariate public keys and temporal rules

**Authors:**
Vasyl Ustimenko, Aneta Wróblewska

**Abstract:**

We introduce large groups of quadratic transformations of a vector space over the finite fields defined via symbolic computations with the usage of

algebraic constructions of Extremal Graph Theory. They can serve as platforms for the protocols of Noncommutative Cryptography with security based on the complexity of word decomposition problem in noncommutative polynomial transformation group.

The modifications of these symbolic computations in the case of large fields of characteristic two allow us to define quadratic bijective multivariate public keys such that the inverses of public maps has a large polynomial degree. Another family of public keys is defined over arbitrary commutative ring with unity.

We suggest the usage of constructed protocols for the private delivery of quadratic encryption maps instead of the public usage of these transformations, i.e. the idea of temporal multivariate rules with their periodical change.

**ePrint:**
https://eprint.iacr.org/2023/738

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 .