Log inSign up
Yansong Feng
96 posts
@fffmath_crypto

Yansong Feng

@fffmath_crypto
Cryptography, ZKP, Lattice, MPC.
fffmath.com
Joined April 2023
72
Following
46
Followers
RepliesRepliesRepostsRepostsMediaMedia

Log in or sign up for X

See what’s happening and join the conversation

Continue with phone
or
Log in with username or email
Terms·Privacy·Cookies·Accessibility·Ads Info·© 2026 X Corp.
  • @fffmath_crypto
    Yansong Feng
    @fffmath_crypto
    Aug 25
    I tried to prove Boneh-Lipton conjecture first with 5.6 sol and then failed. But it told me maybe is not necessary to use this conjecture and then used only ten minutes to return me a proper answer…
    @Lhree
    IACR ePrint Updates
    @Lhree
    Aug 22
    [New] Jacobi Signatures, Revisited (Yansong Feng) ia.cr/2026/1726
  • @fffmath_crypto
    Yansong Feng
    @fffmath_crypto
    Jul 29
    amazing😭
    @AnthropicAI
    Anthropic
    @AnthropicAI
    Jul 28
    Replying to @AnthropicAI
    Full technical details of both attacks are provided in our new papers: On HAWK: anthropic.com/document/hawk_… On AES: anthropic.com/document/aes_m… And the associated model chain-of-thought for AES: anthropic.com/document/aes_m…
    1
  • @fffmath_crypto
    Yansong Feng
    @fffmath_crypto
    Aug 23, 2025
    crypto'25 & pokemon wcs 25! I really hope canteen in aarhus university can provide breakfast like ucsb
    Image
    Image
    Image
  • @fffmath_crypto
    Yansong Feng
    @fffmath_crypto
    May 3, 2025
    Accepted by Crypto'25!!! I'm currently attending Eurocrypt'25—feel free to reach out and discuss!
    @fffmath_crypto
    Yansong Feng
    @fffmath_crypto
    Feb 15, 2025
    We use tools from additive combinatorics to compute the bounds of Coppersmith's method and obtain a series of elegant results. Previously, computing these bounds involved tedious manual calculations or heuristics. Our method is provable and efficient and the code is open-sourced.
  • @fffmath_crypto
    Yansong Feng
    @fffmath_crypto
    Feb 15, 2025
    We use tools from additive combinatorics to compute the bounds of Coppersmith's method and obtain a series of elegant results. Previously, computing these bounds involved tedious manual calculations or heuristics. Our method is provable and efficient and the code is open-sourced.
    @Lhree
    IACR ePrint Updates
    @Lhree
    Feb 15, 2025
    [Revised] Computing Asymptotic Bounds for Small Roots in Coppersmith's Method via Sumset Theory (Yansong Feng and Hengyi Luo and Qiyuan Chen and Abderrahmane Nitaj and Yanbin Pan) ia.cr/2024/1330
Advertisement
Advertisement