Anyu Wang

My research centers on the mathematical foundations of cryptography — developing the frameworks and algorithmic tools that underpin both classical and post-quantum cryptosystems.

Mathematical Problems in Cryptography

At the heart of every cryptosystem lies a computational assumption — a mathematical problem believed to be intractable. My work investigates the hardness assumptions that underpin lattice-based and code-based cryptography, with an emphasis on understanding their intrinsic structure, complexity, and interconnections.

Fully Homomorphic Encryption

Fully Homomorphic Encryption (FHE) enables arbitrary computation on encrypted data, but its practical deployment has long been hindered by performance bottlenecks — most notably the bootstrapping procedure, which refreshes ciphertext noise at a high computational cost. This area of my research focuses on designing and optimizing bootstrapping algorithms and homomorphic computation techniques to bridge the gap between theoretical feasibility and practical efficiency.

Cryptographic Design and Analysis

This direction covers both the design and analysis aspects of post-quantum cryptography. On the design front, my work develops efficient public-key schemes built upon well-studied hard problems and explores new cryptographic frameworks based on diverse mathematical assumptions. On the analysis front, I conduct theoretical cryptanalysis of proposed schemes to stress-test their security guarantees.

AI Security

The rapid proliferation of large language models and AI systems has introduced new security challenges that demand rigorous technical solutions. My work in this area applies cryptographic thinking and formal analysis methodologies to security and safety problems in AI.

In addition to the directions above, my broader interests also encompass topics such as secure implementation of cryptographic primitives, secure multiparty computation, and other areas where cryptographic theory meets real-world security needs.