ⓗⓔⓛⓛⓞ! ϞϞ(๑⚈ ․̫ ⚈๑)∩
I am currently a second-year Ph.D. student under the supervision of Yanbin Pan, and I am expected to graduate in 2027. I also spent one year with the Crypto Group at Aarhus University, hosted by Diego F. Aranha. My research interests lie primarily in the application of Algorithmic Number Theory and Combinatorics to problems in Cryptography and Theoretical Computer Science. I prefer problems with a strong mathematical structure, such as those with an algebraic or combinatorial flavor.
Selected Publications
ヾ(＾∇＾) [DBLP][Google Scholar]
-
Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith’s Method.
Marius A. Aardal, Diego F. Aranha, Yansong Feng, Yiming Gao, Yanbin Pan.
[PDF] -
Computing Asymptotic Bounds for Small Roots in Coppersmith’s Method via Sumset Theory.
Yansong Feng, Hengyi Luo, Qiyuan Chen, Abderrahmane Nitaj, Yanbin Pan.
Crypto 2025 [PDF][CODE] -
On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector.
Yiming Gao, Yansong Feng, Honggang Hu, Yanbin Pan.
[PDF] -
Embedding Integer Lattices as Ideals into Polynomial Rings.
Yihang Cheng, Yansong Feng, Yanbin Pan.
ISSAC 2024 [PDF][CODE]
Activities
External Reviewer: IEEE TDSC 2025, Africacrypt 2025, Asiacrypt 2025
Miscellaneous
Ƶƶ(☄￣▵—▵￣)
- [Useful-Link] A cute website contains many useful links.
Contact
Github | fengyansong [at] amss.ac.cn