[Resource Topic] 2020/1287: Multivariate Cryptographic Primitive based on the product of the roots of a polynomial over a field

Welcome to the resource topic for 2020/1287

Title:
Multivariate Cryptographic Primitive based on the product of the roots of a polynomial over a field

Authors: Borja Gómez

Abstract:

Cryptographic Primitives in Multivariate Public Key Cryptography are of relevant interest, specially in the quadratic case. These primitives classify the families of schemes that we encounter in this field. In this paper, the reader can find a new primitive based on the product of the roots of a polynomial over a field, where the coefficients of this polynomials are the elementary symmetric polynomials on n variables, which guarantees a solution when inverting the scheme. Moreover, a cryptosystem and a digital signature scheme are built on top of this primitive, where distinct parametrizations and criteria that define the schemes are commented, along with applications of attacks available in literature.

ePrint: https://eprint.iacr.org/2020/1287

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 .