International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

The One-Wayness of Jacobi Signatures

Authors:
Henry Corrigan-Gibbs , MIT
David J. Wu , UT Austin
Download:
DOI: 10.1007/978-3-031-68388-6_1 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2024
Abstract: We show that under a mild number-theoretic conjecture, recovering an integer from its Jacobi signature modulo N=p2q, for primes p and q, is as hard as factoring N. This relates, for the first time, the one-wayness of a pseudorandom generator that Damgård proposed in 1988, to a standard number-theoretic problem. In addition, we show breaking the Jacobi pseudorandom function is no harder than factoring.
BibTeX
@inproceedings{crypto-2024-34218,
  title={The One-Wayness of Jacobi Signatures},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-68388-6_1},
  author={Henry Corrigan-Gibbs and David J. Wu},
  year=2024
}