IACR News item: 23 October 2023
Henry Corrigan-Gibbs, David J. Wu
ePrint Report
In this short note, we show that under a mild number-theoretic conjecture, recovering an integer from its Jacobi signature modulo $N = p^2q$, for primes $p$ and $q$, is as hard as factoring $N$.
Additional news items may be found on the IACR news page.