Skip to content
View Threonine's full-sized avatar
  • UCAS
  • Beijing
  • 02:05 (UTC +08:00)

Organizations

@Never-Stop-Exploiting

Block or report Threonine

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
Threonine/README.md

Hi, I'm suansuan 👋

aka 苏氨酸 / Threonine

I'm a PhD student at the Institute of Information Engineering, Chinese Academy of Sciences, working on cryptography and Web security.

I used to play CTF with Never Stop Exploiting (NeSE) and ROIS, back when the scoreboard was still human.

I also occasionally teamed up with r3kapig, the #1 team in the 2025 CTFtime world ranking.

🏴 CTF

Selected 2025 results with NeSE

🏆 Champions: N1CTF · 京麒CTF
🥈 Runner-up: 强网杯 · 0CTF · Crypto CTF · OpenHarmonyCTF · …

Then 2026 happened. LLMs took over CTF, and I retired from the AI slop era. 🤖

🔬 Currently

Security Research Intern · Moonshot AI
Mar 2026–Present · Cybersecurity capabilities of open-source models

🌙 Contributor of Kimi K3: Open Frontier Intelligence

📄 Publications

Two-Bit Lifting for Ternary SIS: Polynomial-Time Collision Attacks on LtHash
IACR ePrint 2026/2083
Breaks LtHash16 with ~2⁸¹ queries, against an original claim of 200+ bits of security.

Wagner's k-Tree Revisited: Memory–Time Costs of Preimage Attacks on Incremental Hashes
IACR ToSC 2026 · FSE 2026 · CCF-B · code
Post-retrieval for Wagner's k-tree, with only Θ(k) recovery-time overhead.

Memory Optimizations of Wagner's Algorithm with Applications to Equihash
IACR TCHES 2026 · CHES 2026 · CCF-B · code
Post-retrieval for Wagner's algorithm, reducing peak memory from ~2nN to ~nN.

Pinned Loading

  1. wagner-ktree-revisited wagner-ktree-revisited Public

    Reproducibility artifact for "Wagner's k-Tree Revisited: Memory-Time Costs of Preimage Attacks on Incremental Hashes" (ToSC 2026).

    Python

  2. my-ctf-challenges my-ctf-challenges Public

    A repository for some CTF challenges I created.