Yansong Feng

Cryptography, ZKP, Lattice, MPC.

[Tom Gur @TomGur]

New on arXiv: we show algorithmic versions of the polynomial Freiman–Ruzsa theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms.
https://t.co/qQ97lFwR2p

[Yansong Feng @fffmath_crypto]

crypto'25 & pokemon wcs 25!
I really hope canteen in aarhus university can provide breakfast like ucsb

[Jonas Nick @n1ckler]

Video: https://t.co/viQa1DNW9D

Slides: https://t.co/E2WlIm5DnG

[Kasper Green Larsen @kasperglarsen]

Reminder: The FINAL registration deadline for ICALP'25 is coming up on June 20th. Hope to see you in Aarhus!

https://t.co/Y8VbLODakM

Please Share!

[refactoreal @refactoreal]

Excited to be a crypto challenge designer for @N0PSctf again this year! I've crafted two challenges and hope you'll join in the CTF and enjoy solving them. Good luck! #N0PSCTF #Crypto 🎉 🎉 🎉

https://t.co/q9cVw3mDwE

[Pokémon @Pokemon]

#PokemonLegendsZA arrives October 16, 2025!

In addition to the #NintendoSwitch title, a #NintendoSwitch2 Edition will offer improved graphics and frame rates! The digital and physical versions of #PokemonLegendsZA can be upgraded to the #NintendoSwitch2 Edition via upgrade pack

[Ϲhristian Knabenhans @cknabs]

I'm happy to finally open-source lattirust, a library for lattice-based zero-knowledge/succinct arguments! Lattirust is somewhat like arkworks, but for lattices; and like lattigo, but for arguments.

➔ https://t.co/Kb41v4UOGQ

[Claudio Orlandi @claudiorlandi]

Save the date! The next NordiCrypt will take place on Monday June 30th in Aarhus. We will start around 10:00. More details soon at https://t.co/ffuAJUnVhT

[David Wong @cryptodavidw]

I dont understand people who write long papers. Split your paper in two: you get two papers. Win win

[Yansong Feng @fffmath_crypto]

Accepted by Crypto'25!!! I'm currently attending Eurocrypt'25—feel free to reach out and discuss!

[Yansong Feng @fffmath_crypto]

We use tools from additive combinatorics to compute the bounds of Coppersmith's method and obtain a series of elegant results. Previously, computing these bounds involved tedious manual calculations or heuristics. Our method is provable and efficient and the code is open-sourced.

[Gautam Kamath @thegautamkamath]

Here's the post: 2/4 https://t.co/a4nLiCxa7W

[Yansong Feng @fffmath_crypto]

@hiraku_mrt why？

[Yansong Feng @fffmath_crypto]

We use tools from additive combinatorics to compute the bounds of Coppersmith's method and obtain a series of elegant results. Previously, computing these bounds involved tedious manual calculations or heuristics. Our method is provable and efficient and the code is open-sourced.

[IACR ePrint Updates @Lhree]

[Revised] Computing Asymptotic Bounds for Small Roots in Coppersmith's Method via Sumset Theory (Yansong Feng and Hengyi Luo and Qiyuan Chen and Abderrahmane Nitaj and Yanbin Pan) https://t.co/jGOyLSMnna

[Quanta Magazine @QuantaMagazine]

In 2023, then-undergraduate Andrew Krapivin read through a paper on computing memory “just for fun.” As a result, he ended up dramatically re-vamping a classic 70-year-old computing tool known as the hash table.
https://t.co/Zn7PZ7ZFSM

[FakeIACR @FakeIACR]

Because of new tariffs, submissions to crypto with a non US author have a 20% reduction to their page limit.

[Yansong Feng @fffmath_crypto]

@mfesgin which one? Bluesky?

[Claudio Orlandi @claudiorlandi]

Postdoc opportunity in MPC/Quantum at OIST Japan, in collaboration with Partisia, Aarhus https://t.co/H6eVixt3XV

[SKG @sonukg4india]

The Magic of the Whole Part.
You will not see a more beautiful mathematical expression for the current year than this one.

e π
[ π + e ] ² = 2025
#Eneatipo7
#2025newyear
#HappyNewYear2025

[Yansong Feng @fffmath_crypto]

Happy year ( sum_{i \in range(10)} )^2!

[FakeIACR @FakeIACR]

Happy year sum_{i \in range(10)} i^3!

[Martin R. Albrecht @martinralbrecht]

We got a PhD Position in Lattice-Based Cryptography at King's College London @CysKCLInf @kclinformatics

https://t.co/zJf3m5Ptir

https://t.co/TYcy7IqWNs