I am an assistant professor at Tsinghua University Institute for Interdisciplinary Information Science (IIIS). Before joining Tsinghua I was a researcher at VISA Research. In 2018 I got my Ph.D. from Boston University under the guidance of Professor Ran Canetti and Professor Leonid Reyzin. I attended college at Shanghai Jiao Tong University, where I was seduced to science by an interesting problem.
My research interest is cryptography. As cryptographers, our mission is to spread love with mystery. Occasionally I make comic slides to carry out my duty; see samples "Merkletree", "Napoleon", "Howareyou", "VAR", "KuleshovEffect", EC2020rump.
My research interest is cryptography. As cryptographers, our mission is to spread love with mystery. Occasionally I make comic slides to carry out my duty; see samples "Merkletree", "Napoleon", "Howareyou", "VAR", "KuleshovEffect", EC2020rump.
Update on April 18: Step 9 of the algorithm contains a bug, which I don’t know how to fix. See the updated version of eprint/2024/555 - Section 3.5.9 (Page 37) for details. I sincerely thank Hongxun Wu and (independently) Thomas Vidick for finding the bug today.
Now the claim of showing a polynomial time quantum algorithm for solving LWE with polynomial modulus-noise ratios does not hold. I leave the rest of the paper as it is (added a clarification of an operation in Step 8) as a hope that ideas like Complex Gaussian and windowed QFT may find other applications in quantum computation, or tackle LWE in other ways.
Now the claim of showing a polynomial time quantum algorithm for solving LWE with polynomial modulus-noise ratios does not hold. I leave the rest of the paper as it is (added a clarification of an operation in Step 8) as a hope that ideas like Complex Gaussian and windowed QFT may find other applications in quantum computation, or tackle LWE in other ways.