The search for “MPC-friendly” primitives has led cryptographers back to some very classical number theory. In the world of Secure Multi-Party Computation (MPC), the cost of a protocol is often domi...
Read More →
Mapping the Max-Cut Problem to Ising Spin Glasses
In the previous post, I explored the physics of Ising models and how Simulated Annealing can find global minima in complex energy landscapes. Now, I want to step away from pure physics and enter th...
Read More →
Stochastic Modeling of Ising Spin Glasses via Metropolis-Hastings
Finding the global minimum of a complex, non-convex energy landscape is a fundamental problem in both statistical mechanics and combinatorial optimization. When we deal with “Spin Glasses” (systems...
Read More →
MPC in the Head (MPCitH)
In continuation to my MPC blogs and my study of FAEST, here is a blog explaining a method of constructing advanced Zero Knowledge (ZK) proofs by using simpler tools from Multi-Party Computation (MP...
Read More →
Gentry-Lee Encoding for Efficient Matrix FHE
Craig Gentry (yeah the man himself) and Yongwoo Lee proposed a new FHE scheme quite recently (October 2025). The special thing about this new scheme is its algorithmic efficiency towards Homomorphi...
Read More →
Need for Gadget Decomposition in LWE Based Cryptosystems
Gadget Decomposition is one of the key and essential Homomorphic Operations in FHE cryptosystems based on the LWE problem. I have already introduced the LWE problem and how to build a basic cryptos...
Read More →