ⓗⓔⓛⓛⓞ!

Now I am a first-year PhD student under the guidance of Yanbin Pan. My research interests primarily revolve around Algorithms & Theory, particularly in Lattice-based Cryptography and Succinct Zero-Knowledge Proofs.

Currently, I am visiting the Crypto Group in Aarhus University from October 2024 to October 2025, hosted by Diego F. Aranha.

Selected Publications

ヾ(＾∇＾) My favourite results:

• [~Ⴚ(●ტ●)Ⴢ~] Newton Polytope-Based Strategy for Finding Roots of Multivariate Polynomials.
  ???
  Yansong Feng, Abderrahmane Nitaj, Yanbin Pan.
  [PDF]

• Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA.
  CIC 2024
  Yansong Feng, Abderrahmane Nitaj, Yanbin Pan.
  [PDF][CODE]

• Embedding Integer Lattices as Ideals into Polynomial Rings.
  ISSAC 2024
  Yihang Cheng, Yansong Feng, Yanbin Pan.
  [PDF][CODE]

Talks

(👍≖‿‿≖)👍 👍(≖‿‿≖👍)

• Sovling Polynomial Equations with Newton Polytope

  • [November 15, 2024] NordiCrypt, University of Southern Denmark, Denmark [Slides]
  • [November 21, 2024] Crypto Group Seminar, Aarhus University, Denmark [Slides]

• Solving Modular Linear Equations via Automated Coppersmith and its Applications

  • [December ???, 2024] Inscrypt, Yulongwan Resort, China [Slides]

• Generalized Implicit Factorization Problem

  • [December 24, 2023] AI for Math 理论探索与工程应用研讨会, Institute of Automation, Chinese of Academy of Sciences, China [Slides]
  • [August 18, 2023] Selected Areas in Cryptography, University of New Brunswick, Canada [Slides]

Miscellaneous

ʕ•̫͡•ʕ•̫͡•ʔ•̫͡•ʔ•̫͡•ʕ•̫͡•ʔ•̫͡•ʔ

• [CV] My CV in PDF format.

• [Useful-Link] A cute website contains many useful links.

Contact

Github | DBLP | Google Scholar | fengyansong [at] amss.ac.cn