HELLO! I'M YANSONG FENG ▼
Z
z
z
▶ 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. 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. I'm visiting NUS from March 1st to the end of May, hosted by Divesh Aggarwal.
★ SELECTED PUBLICATIONS [DBLP] [Scholar]
- Subset Balancing and Generalized Subset Sum via Lattices
- Revisit Unravelled Linearization with Erhart (quasi-)Polynomial
- 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
★ PROJECTS
★ ACTIVITIES
- ▶ Trips & Talks
- ▶ External Reviewer: Asiacrypt, PKC, Africacrypt, IEEE TDSC