Welcome to the resource topic for 2019/862
Title:
Key recovery attacks on the Legendre PRFs within the birthday bound
Authors: Dmitry Khovratovich
Abstract:We show that Legendre PRF, recently suggested as an MPC-friendly primitive in a prime field Z_p, admits key recovery attacks of complexity O(\sqrt{p}) rather than previously assumed O(p). We also demonstrate new attacks on high-degree versions of this PRF, improving on the previous results by Russell and Shparlinski.
ePrint: https://eprint.iacr.org/2019/862
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .