Short Bio

I am a Ph.D. student in cybersecurity at the University of Chinese Academy of Sciences (UCAS), advised by Prof. Xiaorui Gong. I received my B.E. degree in information security from the University of Science and Technology of China (USTC) in 2022. Prior to 2026, I was actively involved in CTF competitions with the NeSE team, focusing on cryptography and blockchain.

My doctoral research focuses on applied cryptography, particularly the Generalized Birthday Problem and its cryptanalytic applications. Now I am focusing on LLM post-training and exploring the intersection of AI and cryptography. I will graduate in June 2027 and am open to opportunities.

Research Interests

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.

News

  1. I expect to complete my Ph.D. in June 2027. I’m looking for postdoctoral or other research positions in LLM post-training, cryptography and AI, or cybersecurity. If you find my research areas matching any opportunity, please feel free to contact me via email.

  2. We released our automated cryptanalysis results found by a MiniMax internal model. See our technical reports in MiniMax Research.

  3. Our joint work on using LLM agents to discover vulnerabilities in cryptographic libraries will be presented at the Black Hat USA 2026 Briefings. See the talk page for details.

Experience

Education

  1. Ph.D. Candidate in Cybersecurity

    University of Chinese Academy of Sciences

    Beijing, China

    Straight-to-PhD. Major in Cybersecurity.

  2. B.Eng. in Information Security

    University of Science and Technology of China

    Hefei, China

Intern

  1. Research Intern

    MiniMax

    Beijing, China

    Post-training of MiniMax cyber models. Automated Cryptanalysis & AI for Security.

  2. Post-Quantum Research Intern, Ant Research

    Ant Group

    Beijing, China

    Conducted security analysis of ML-DSA (Dilithium) and its implementation bugs.

  3. Research Intern, Tencent Xuanwu Lab

    Tencent Technology

    Beijing, China

    Automated discovery of cryptography vulnerabilities using LLM agents.

Publications & Presentations

On the Regularity of the Generalized Birthday Problem

Crypto 2026

Lili Tang, Yao Sun, and Xiaorui Gong

The 46th International Cryptology Conference Show details Hide details

TL;DR: We study structural regularity in the Generalized Birthday Problem and its impact on practical schemes including incremental hashing and Equihash. The main contribution of this work is the complexity analysis of regular and non-regular GBP, with important implications for the $k$-$\textsf{XOR}$ and $k$-$\textsf{SUM}$ problems.

CCF-ACORE-A*

Memory Optimizations of Wagner’s Algorithm with Applications to Equihash

CHES 2026

Lili Tang, Rui Ding, Yao Sun, and Xiaorui Gong

IACR Transactions on Cryptographic Hardware and Embedded Systems, 2026 (2) Show details Hide details

TL;DR: We propose a new list-item-reduction framework that reduces the memory complexity of Wagner’s algorithm from $2nN$ to $nN$ bits, thereby weakening the ASIC resistance of Equihash. This optimization has important implications for the efficient implementation of Wagner-style algorithms.

CCF-BCORE-A

k-Tree Revisited: Memory-Time Cost of Preimage Attack on Incremental Hashes

FSE 2027

Rui Ding*, Lili Tang*, Shaomin Chen, and Xiaorui Gong Equal Contribution

IACR Transactions on Symmetric Cryptology, 2026 (3) Show details Hide details

TL;DR: We extend post-retrieval to Wagner’s $k$-tree algorithm, reducing peak memory from exponential in $k$ to $O(k^2\ell N)$ with only linear time overhead. Applied to preimage attacks on incremental hashes, this trade-off can substantially reduce their memory–time cost.

CCF-BCORE-B

A Counterexample to Tokareva’s Conjecture on Sums of Two Bent Functions

Preprint

Yansong Feng, Hao Jiang, Guancheng Li, Tianyi Li, and Lili Tang

arXiv Show details Hide details

TL;DR: We disprove Tokareva’s conjecture that every Boolean function on $\mathbb{F}_2^n$ of algebraic degree at most $n/2$ can be written as a sum of two bent functions, constructing explicit counterexamples for all even $n \ge 8$ via large-scale automated reasoning with LLM agents.

Two-Bit Lifting for Ternary SIS: Polynomial-Time Collision Attacks on LtHash

Preprint

Rui Ding, Xiaorui Gong, Hao Jiang, and Lili Tang

IACR ePrint Show details Hide details

TL;DR: We introduce two-bit lifting for ternary SIS, reducing the query complexity of polynomial-time LtHash collision attacks while preserving ternary coefficients. For LtHash16, the attack uses about $2^{81}$ hash queries.

Talks & Presentations

Breaking the Unbreakable: Dismantling the Myth of Trusted Cryptographic Libraries

Black Hat USA

Guannan Wang, Lili Tang, and Guancheng Li Speakers

Black Hat USA 2026 BriefingsAug 1-6, 2026Las VegasOn Demand

Capture The Flag (CTF)

CTF Team

  1. NeSE Team

    Institute of Information Engineering, UCAS

    Crypto & Blockchain.

    Beijing, China
  2. Nebula Team

    USTC

    Crypto & Reverse Engineering.

    Hefei, China

Selected Awards

Crypto CTF 2025 2nd Place

NeSE’s crypto team: tl2cents (me), deebato, and Threonine.

CaptainAll Kill