Choose a wallpaper
How This Site Was Built
An interactive desktop site pairing a 3D study room. This site is vibed with GPT-Astra-6 and Gemini Carbon. The following homepages and open-source projects inspired the design. Thanks for the open-source contributions.
Inspirations & References
3D desk setup projecting a live HTML/CSS3D desktop website inside the monitor.
Custom GLSL rim lighting, stippled grain and volumetric sunbeams.
Orthographic dotted globe card showing live distance and weather between visitor and host.
The lock pattern that unlocks the desktop. I also made a playable version of this game, which is online at tang.cat/lock-game.
Tech Stack
- 3D Studio
- Three.js WebGL + frame-synced CSS3D iframe
- Desktop UI
- Jekyll static build, vanilla ES modules, bundled xterm.js local terminal
- Backdrops & Map
- PixiJS 8 scene lighting shader + Canvas 2D globe with Open-Meteo weather
Right-click the desktop for shortcuts. Drag a window by its title; press Esc to close.
Research Interests
I competed in CTFs from 2021 through the end of 2025, specializing in cryptography and blockchain. I now study large language model training and applications of AI in security.
- Large Language Models (LLM): LLM post-training (SFT & RL). Advancing and benchmarking frontier models in cryptography and cybersecurity.
- Cryptography + AI: Automated cryptanalysis and vulnerability discovery using LLM agents. Currently learning Lean 4 and formal verification for cryptography.
前 CTF 选手(2021-2025 年末),密码学和区块链方向。目前在研究大模型训练与 AI 在安全领域的应用。
- 大语言模型(LLM):大语言模型后训练(SFT 与 RL),提升和评测前沿模型在密码学与网络安全任务中的能力。
- 密码学 + AI:利用 LLM 智能体进行自动化密码分析与漏洞发现。目前正在学习 Lean 4 和密码学形式化验证。
Publications
A Counterexample to Tokareva’s Conjecture on Sums of Two Bent Functions
Yansong Feng, Hao Jiang, Guancheng Li, Tianyi Li, and Lili Tang
Two-Bit Lifting for Ternary SIS: Polynomial-Time Collision Attacks on LtHash
Rui Ding, Xiaorui Gong, Hao Jiang, and Lili Tang
Presentation
Lili Tang(唐雳雳)
Ph.D. Candidate in Cybersecurity at UCAS; B.E. in Information Security from USTC (2022).
My doctoral research primarily focuses on the Generalized Birthday Problem and Wagner’s algorithm. My current interests are LLM post-training and LLM agents for cryptanalysis and vulnerability discovery. I am also learning Lean 4 for formal verification in cryptography.
Fast Fourier Transform and Number Theoretic Transform
The Fast Fourier Transform (FFT) is generally credited to Cooley and Tukey in 1965, although its earliest ideas can be traced back to Gauss's unpublished manuscript around 1805. FFT is one of the foundational algorithms behind modern high-performance computation: it accelerates integer multiplication and polynomial multiplication, and was named by IEEE as one of the top ten algorithms of the twentieth century. Current NIST post-quantum standards such as Kyber, Dilithium, and Falcon all involve FFT and its finite-field analogue, the Number Theoretic Transform (NTT). In addition, NTT is a critical acceleration primitive in practical zero-knowledge proof systems such as Plonk and in fully homomorphic encryption schemes such as BFV and TFHE. This article explains the mathematical theory and practical value of FFT and NTT in detail.
Auto-Cryptanalysis
I am a core contributor to the MiniMax Cyber Team’s automated cryptanalysis project. We built an agent pipeline that broke numerous former NIST candidates and recent cryptographic designs without human intervention.
The Most Complicated Lock Pattern Game
Find the most complicated Android-style unlock pattern by covering every distinct slope on the grid. For the inspiration, see [What Is The Most Complicated Lock Pattern?](https://www.youtube.com/watch?v=PKjbBQ0PBCQ) on YouTube.
Auto-Cryptanalysis
I am a core contributor to the MiniMax Cyber Team’s automated cryptanalysis project. We built an agent pipeline that broke numerous former NIST candidates and recent cryptographic designs without human intervention.
Empty folder
Empty folder
Saved in this browser. Right-click the desktop to create another folder.
