Yansong Feng

Orcid: 0009-0007-7085-377X

Affiliations:
  • Chinese Academy of Sciences, Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Beijing, China


According to our database1, Yansong Feng authored at least 16 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Subset Balancing and Generalized Subset Sum via Lattices.
CoRR, April, 2026

Revisit Unravelled Linearization with Erhart (quasi-)Polynomial.
IACR Cryptol. ePrint Arch., 2026

Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith's Method.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
New Asymptotic Results on Predicting Non-linear Polynomial Congruential Generators.
IACR Cryptol. ePrint Arch., 2025

Solving LWE with Independent Hints about Secret and Errors.
IACR Cryptol. ePrint Arch., 2025

On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector.
IACR Cryptol. ePrint Arch., 2025

Computing Asymptotic Bounds for Small Roots in Coppersmith's Method via Sumset Theory.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Improving RSA Cryptanalysis: Combining Continued Fractions and Coppersmith's Techniques.
Proceedings of the Information Security and Privacy - 30th Australasian Conference, 2025

2024
Partial prime factor exposure attacks on some RSA variants.
Theor. Comput. Sci., 2024

New Results for Coppersmith's Method from the Perspective of Sumsets Theory.
IACR Cryptol. ePrint Arch., 2024

Practical Small Private Exponent Attacks against RSA.
IACR Cryptol. ePrint Arch., 2024

Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA.
IACR Commun. Cryptol., 2024

Embedding Integer Lattices as Ideals into Polynomial Rings.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

Solving Modular Linear Equations via Automated Coppersmith and Its Applications.
Proceedings of the Information Security and Cryptology - 20th International Conference, 2024

2023
Generalized Implicit Factorization Problem.
Proceedings of the Selected Areas in Cryptography - SAC 2023, 2023

2022
On Rangasamy's outsourcing algorithm for solving quadratic congruence equations.
CoRR, 2022


  Loading...