Public-Key Encryption from the MinRank Problem
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908576977518592 |
|---|---|
| author | Chatterjee, Rohit Mu, Changrui Vasudevan, Prashant Nalini |
| author_facet | Chatterjee, Rohit Mu, Changrui Vasudevan, Prashant Nalini |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_03752 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Public-Key Encryption from the MinRank Problem Chatterjee, Rohit Mu, Changrui Vasudevan, Prashant Nalini Cryptography and Security 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. |
| title | Public-Key Encryption from the MinRank Problem |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2510.03752 |