Paper 2019/862 Original: eprint.iacr.org/2019/862 ↗
Key recovery attacks on the Legendre PRFs within the birthday bound
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2019-07-25: last updated
- 2019-07-25: published
- Short URL
- https://ia.cr/2019/862
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/862,
author = {Dmitry Khovratovich},
title = {Key recovery attacks on the Legendre PRFs within the birthday bound},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/862},
year = {2019},
url = {https://eprint.iacr.org/2019/862}
}