ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Tue 星期二
05.27
2025
Breaking Poseidon Challenges with Graeffe Transforms and Complexity Analysis by FFT Lower Bounds https://eprint.iacr.org/2025/950
Zhao and Ding proposed a method in their paper to break Poseidon challenges with Graeffe transforms and complexity analysis by FFT lower bounds, significantly improving the attack efficiency, and open-sourced the related code. Note: The effective security of Poseidon has not been reduced. Zhao和Ding在论文中提出了一种利用Graeffe变换和FFT下界复杂性分析破解Poseidon挑战的方法，显著提高了攻击效率，并开源了相关代码。注：Poseidon的有效安全性并没有降低。
Fast elliptic curve scalar multiplications in SN(T)ARK circuits https://eprint.iacr.org/2025/933
Eagen et al. proposed a new technique in their paper to speed up elliptic curve scalar multiplications in SN(T)ARK circuits, reducing proof time by 22% to 53% through integer lattice reduction or semi-extended Euclidean algorithm. Eagen等人在论文中提出了在SN(T)ARK电路中快速进行椭圆曲线标量乘法的新技术，通过整数格约简或半扩展欧几里得算法，将证明时间缩短了22%至53%。