Public Key Encryption from the MinRank Problem

Title of the Talk:Public Key Encryption from the MinRank Problem
Host Faculty: Dr.M V Panduranga Rao
Speaker: Dr Rohit Chatterjee
Date: 05 May 2026
Time: 02:30 pm

Abstract
He will discuss our new 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.

Bio
Rohit is a postdoctoral research fellow at the School of Computing in NUS. He looks at the foundations of cryptographic primitives and the interplay between them. He also works on post-quantum and some aspects of quantum cryptography. He is broadly interested in the intersection of theory CS and cryptography.