Yansong Feng『冯岩松』

photo

ⓗⓔⓛⓛⓞ! (👍≖‿‿≖)👍 👍(≖‿‿≖👍)

Now I am a PhD student under the guidance of Yanbin Pan and I also spent one year in the Crypto Group at Aarhus University, hosted by Diego F. Aranha. My research interests primarily focus on applying Algorithmic Number Theory and Combinatorics to problems in Cryptography. I prefer problems with a strong mathematical structure, such as those with an algebraic or combinatorial flavor.

Together with my collaborators, we introduced additive combinatorics into Coppersmith’s method, which enabled us to remove manual calculations of success conditions. This work was accepted to Crypto’25, and we also have several interesting applications and follow-up results.

Currently, I am interested in leakage-resilient secret sharing, not only in terms of lower bounds but also in proving security. I particularly enjoy the Fourier analysis and additive combinatorics tools used in this area.

🔴 I am currently looking for a postdoc.

Selected Publications

ヾ(^∇^) Some of my favourite results (A full list of publications):

Activities

Trips & Talks

External Reviewer: IEEE TDSC 2025, Africacrypt 2025, Asiacrypt 2025

Miscellaneous

ʕ•̫͡•ʕ•̫͡•ʔ•̫͡•ʔ•̫͡•ʕ•̫͡•ʔ•̫͡•ʔ

Contact

Github | DBLP | Google Scholar | fengyansong [at] amss.ac.cn