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

Borja Gómez

Paper 2020/1287

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

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Contact author(s): kub0x @ elhacker net
History: 2020-10-16: received
Short URL: https://ia.cr/2020/1287
License: CC BY

BibTeX

@misc{cryptoeprint:2020/1287,
      author = {Borja Gómez},
      title = {Multivariate Cryptographic Primitive based on the product of the roots of a polynomial over a field},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/1287},
      year = {2020},
      url = {https://eprint.iacr.org/2020/1287}
}