GeezerVison

VISITING EXPERIENCE

• 2024/06 – 2024/09. The Hong Kong Polytechnic University, Hong Kong. Hosted by Man Ho Allen Au.

• 2024/10 – 2025/10. Crypto Group, Aarhus University, Aarhus, Denmark. Hosted by Diego F. Aranha.

• 2025/09 (one week). Laboratory of Mathematics Nicolas Oresme, University of Caen Normandy, Caen, France. Hosted by Abderrahmane Nitaj.

• 2026/03 – 2026/06. National University of Singapore, Singapore. Hosted by Divesh Aggarwal.

SERVICE

Program Committee

CT-RSA 2027

Subreviewer

SODA, ASIACRYPT, PKC

PEER-REVIEWED PUBLICATIONS

• New Asymptotic Results on Predicting Polynomial Congruential Generators

  Yansong Feng, Abderrahmane Nitaj, Yanbin Pan, Mengce Zheng · ASIACRYPT 2026 [ePrint] [Code]

• Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith's Method

  Marius A. Aardal, Diego F. Aranha, Yansong Feng, Yiming Gao, Yanbin Pan · EUROCRYPT 2026 [ePrint] [Code]

• On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector

  Yiming Gao, Yansong Feng, Honggang Hu, Yanbin Pan · Math. Comp. 2026 [arXiv]

• 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 [ePrint] [Code]

• Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA

  Yansong Feng, Abderrahmane Nitaj, Yanbin Pan · CiC 2024 [ePrint] [Code]

• Embedding Integer Lattices as Ideals into Polynomial Rings

  Yihang Cheng, Yansong Feng, Yanbin Pan · ISSAC 2024 [ePrint] [Code]

• Partial Prime Factor Exposure Attacks on Some RSA Variants

  Yansong Feng, Abderrahmane Nitaj, Yanbin Pan · Theor. Comput. Sci. 2024 [DOI]

• Generalized Implicit Factorization Problem

  Yansong Feng, Abderrahmane Nitaj, Yanbin Pan · SAC 2023 [ePrint] [Code]

MANUSCRIPTS

• Subset Balancing and Generalized Subset Sum via Lattices

  Yiming Gao, Yansong Feng, Honggang Hu, Yanbin Pan [arXiv]

• Revisit Unravelled Linearization with Ehrhart (quasi-)Polynomial

  Yansong Feng, Yiming Gao, Honggang Hu, Abderrahmane Nitaj, Yanbin Pan, Mengce Zheng [ePrint]

🤖 AI made significant contributions to the manuscripts below.

• A counterexample to Tokareva's conjecture on sums of two bent functions

  Yansong Feng, Hao Jiang, Guancheng Li, Tianyi Li, Lili Tang [arXiv] [Wolfram MathWorld]

• Faster SVP in Polynomial Space

  Yansong Feng, Yiming Gao, Jiaqi Liu [arXiv]

• SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules

  Jiaqi Liu, Yansong Feng, Yanbin Pan [arXiv]

• CVP Is NP-Hard for Principal Cyclotomic Ideals

  Jiaqi Liu, Yansong Feng, Yanbin Pan [arXiv]

• Discrete Gaussian Sampling Meets BDGL Decoding: Solving the Shortest Vector Problem in 2^0.5596n+o(n) Time

  Yiming Gao, Yansong Feng, Honggang Hu [ePrint]

• Solving the Shortest Vector Problem in 2^0.7314n+o(n) Time via Discrete Gaussian Sampling on Superlattices

  Yiming Gao, Yansong Feng, Honggang Hu [ePrint]

• Jacobi Signatures, Revisited

  Yansong Feng [ePrint]