Cryptology ePrint Archive: Report 2021/1476

Multivariate public key cryptography with polynomial composition

Emile Hautefeuille

Abstract: This paper presents a new public key cryptography scheme using multivariate polynomials in a finite field. Each multivariate polynomial from the public key is obtained by secretly and repeatedly composing quadratic polynomials (of a single variable) with linear combinations of the input variables. Decoding a message involves recursively computing the roots of these quadratic polynomials, and finally solving some linear systems. The main drawback of this scheme is the length of the public key.

Category / Keywords: public-key cryptography / public-key cryptography, multivariate cryptography

Date: received 6 Nov 2021

Contact author: emile hautefeuille at polytechnique edu

Available format(s): PDF | BibTeX Citation

Version: 20211106:160712 (All versions of this report)

Short URL: ia.cr/2021/1476


[ Cryptology ePrint archive ]