Multivariate Public Key Cryptosystem from Sidon Spaces

Netanel Raviv, 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.

Available format(s)
Publication info
Keywords
Multivariate Public Key CryptosystemMinRank ProblemSidon Spaces
Contact author(s)
netanel raviv @ wustl edu
blangton @ g hmc edu
zactamo @ gmail com
History
Short URL
https://ia.cr/2021/254

CC BY

BibTeX

@misc{cryptoeprint:2021/254,
author = {Netanel Raviv and Ben Langton and Itzhak Tamo},
title = {Multivariate Public Key Cryptosystem from Sidon Spaces},
howpublished = {Cryptology ePrint Archive, Paper 2021/254},
year = {2021},
note = {\url{https://eprint.iacr.org/2021/254}},
url = {https://eprint.iacr.org/2021/254}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.