HELLO! I'M YANSONG FENG ▼
▶ ABOUT ME:
Hi! I am currently a second-year Ph.D. student under the supervision of Yanbin Pan, and I am expected to graduate in 2027. 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. Recently, I have also become interested in AI for security and AI-assisted formal verification.
★ PUBLICATIONS [DBLP] [Scholar]
MANUSCRIPTS
PEER-REVIEWED PUBLICATIONS
- Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith's Method
- On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
- Computing Asymptotic Bounds for Small Roots in Coppersmith's Method via Sumset Theory
- Small public exponent brings more: Improved partial key exposure attacks against RSA
- Embedding Integer Lattices as Ideals into Polynomial Rings
- Generalized implicit factorization problem
★ ACTIVITY
VISITING EXPERIENCE
- Visiting National University of Singapore (NUS) from March 2026 to May 2026, hosted by Divesh Aggarwal.
- Visiting the Laboratory of Mathematics Nicolas Oresme, University of Caen Normandy, France, for one week in September 2025, hosted by Abderrahmane Nitaj.
- Visiting the Crypto Group at Aarhus University from October 2024 to October 2025, hosted by Diego F. Aranha.
- Visiting The Hong Kong Polytechnic University (PolyU) from June 2024 to September 2024, hosted by Man Ho Allen Au.
TALKS
Solving Polynomial Equations with Newton Polytope
Solving Modular Linear Equations via Automated Coppersmith and its Applications
- [Dec 14, 2024] Inscrypt, Yulongwan Resort, China [Slides]
SERVICE
- ▶ External Reviewer: Asiacrypt, PKC, Africacrypt, IEEE TDSC