Public-Key Encryption from the MinRank Problem

Rohit Chatterjee; Changrui Mu; Prashant Nalini Vasudevan

doi:10.1007/978-3-032-25327-9_16

EUROCRYPT2026顶会

Public-Key Encryption from the MinRank Problem

Rohit Chatterjee, Changrui Mu, Prashant Nalini Vasudevan

arXiv DOI 出版方

2026年份

摘要

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.