Legendre PRF bounties

The Legendre PRF

The Legendre pseudo-random function is a one-bit PRF defined using the Legendre symbol:

Bounties

$ 10,000

  For either

  • a sub-exponential, i.e. , classical key recovery algorithm that extracts the key using inputs chosen by the attacker1
  • a security proof showing the non-existence of such an algorithm by reducing it to a well-established computational hardness assumption (see below)

$ 3,000

  For a classical key recovery algorithm improving on the Khovratovich ( where is the number of PRF queries needed) algorithm, using a sub-exponential, i.e. number of queries.1 2

$ 1,000

  For the most interesting paper on the Legendre PRF in the next year (ends 31 August 2020)3

Fhe first bounties are for the first entry that beats the given bounds. Please send submissions to Dankrad Feist dankrad .at. ethereum .dot. org.

Computational hardness assumptions

For the reduction to a well-established computational hardness assumption, we consider the assumptions below which are taken from the Wikipedia page

  • Integer factorization problem
  • RSA problem
  • Quadratic residuosity, higher residuosity and decisional composite residuosity problem
  • Phi-hiding assumption
  • Discrete logarithm, Diffie-Hellman and Decisional Diffie-Hellman in
  • Lattice problems: Shortest vector and learning with errors

Concrete instances

TBA: Some bounties for key recovery in concrete instances will be announced soon, stay tuned.

Research papers

  1. In all cases, probabilistic algorithms are also considered if they improve on the probabilistic versions of the known algorithms. Only classical (non-quantum) algorithms are permitted for the algorithm bounties.  2

  2. For this bounty, we also consider any algorithm that can distinguish a bit length output of the Legendre PRF from a random bit string with advantage  

  3. A cryptographer will be appointed by the Ethereum Foundation to judge this (TBD)