Cryptology ePrint Archive: Report 2021/254

Multivariate Public Key Cryptosystem from Sidon Spaces

Netanel Raviv and Ben Langton and Itzhak Tamo

Abstract: A Sidon space is a subspace of an extension field over a base field in which the product of any two elements can be factored uniquely, up to constants. This paper proposes a new a public-key cryptosystem of the multivariate type which is based on Sidon spaces, and has the potential to remain secure even if quantum supremacy is attained. This system, whose security relies on the hardness of the well-known MinRank problem, is shown to be resilient to several straightforward algebraic attacks. In particular, it is proved that the two popular attacks on the MinRank problem, the kernel attack and the minor attack, succeed only with exponentially small probability. The system is implemented in software, and its hardness is demonstrated experimentally.

Category / Keywords: Multivariate Public Key Cryptosystem, MinRank Problem, Sidon Spaces

Original Publication (in the same form): IACR-PKC-2021

Date: received 2 Mar 2021

Contact author: netanel raviv at wustl edu, blangton@g hmc edu, zactamo@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20210303:172123 (All versions of this report)

Short URL: ia.cr/2021/254


[ Cryptology ePrint archive ]