HELLO! I'M YANSONG FENG ▼
My research focuses on algorithmic number theory and combinatorics, with applications to cryptography and theoretical computer science. Recently, I am also interested in AI for security and AI-assisted formal verification.
EDUCATION & WORK EXPERIENCE
-
– Present. Ph.D. Student, Academy of Mathematics and Systems Science (AMSS), Chinese Academy of Sciences (CAS). Academic Supervisor: Yanbin Pan.
-
– Present. AI4Crypto Research Intern, MiniMax.
VISITING EXPERIENCE
-
– . The Hong Kong Polytechnic University, Hong Kong. Hosted by Man Ho Allen Au.
-
– . Crypto Group, Aarhus University, Aarhus, Denmark. Hosted by Diego F. Aranha.
-
(one week). Laboratory of Mathematics Nicolas Oresme, University of Caen Normandy, Caen, France. Hosted by Abderrahmane Nitaj.
-
– . National University of Singapore, Singapore. Hosted by Divesh Aggarwal.
I expect to graduate in 2027 and am seeking full-time opportunities in industry or as a postdoctoral researcher. Please feel free to contact me!
★ PUBLICATIONS [DBLP] [Scholar]
MANUSCRIPTS
-
Exact CVP Is NP-Complete for Principal Cyclotomic Ideals
-
Jacobi Signatures, Revisited
-
Solving the Shortest Vector Problem in 20.7314n+o(n) Time via Discrete Gaussian Sampling on Superlattices
-
Subset Balancing and Generalized Subset Sum via Lattices
-
Revisit Unravelled Linearization with Ehrhart (quasi-)Polynomial
PEER-REVIEWED PUBLICATIONS
-
New Asymptotic Results on Predicting Polynomial Congruential Generators
-
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