Humble Primer on Approximation Algorithms
Some problems are so hard that finding the perfect answer would take forever. Approximation algorithms ask a humbler question: how close can we get, quickly, and how do we know?
Sandhya Saravanan
Blog
Notes on research, engineering, and things I am currently exploring.
Pseudorandom Generators and Pseudorandom Functions
The intuition behind pseudorandom generators and pseudorandom functions, and why they matter in modern cryptography.
First Post: My Mission to Communicate Research
A personal note on beginning a PhD in applied cryptography, impostor syndrome, and the dream of making cryptography accessible to middle schoolers.
Powered by Jekyll and Minimal Light theme.