1 citations · 1 across the 5 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.CC2025
Decoding Balanced Linear Codes With Preprocessing
Andrej Bogdanov, Rohit Chatterjee, Yunqi Li +1
Prange's information set algorithm is a decoding algorithm for arbitrary linear codes. It decodes corrupted codewords of any -linear code of message length up…
cs.CR2025
Public-Key Encryption from the MinRank Problem
Rohit Chatterjee, Changrui Mu, Prashant Nalini Vasudevan
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…
cs.CR2025
Improved Search-to-Decision Reduction for Random Local Functions
Kel Zin Tan, Prashant Nalini Vasudevan
A random local function defined by a -ary predicate is one where each output bit is computed by applying to randomly chosen bits of its input. These represent natura…