Public-Key Encryption from the MinRank Problem
Cryptography and Security
2025-10-07 v1
Abstract
We construct a public-key encryption scheme from the hardness of the (planted) MinRank problem over uniformly random instances. This corresponds to the hardness of decoding random linear rank-metric codes. Existing constructions of public-key encryption from such problems require hardness for structured instances arising from the masking of efficiently decodable codes. Central to our construction is the development of a new notion of duality for rank-metric codes.
Keywords
Cite
@article{arxiv.2510.03752,
title = {Public-Key Encryption from the MinRank Problem},
author = {Rohit Chatterjee and Changrui Mu and Prashant Nalini Vasudevan},
journal= {arXiv preprint arXiv:2510.03752},
year = {2025}
}