Table 1 Complexities of the attacks on the sequentiality of our VDF, consisting of the cases for classical and quantum computers
From: Verifiable delay functions and delay encryptions from hyperelliptic curves
Attacks | Classical | Quantum |
|---|---|---|
Computing shortcuts | \({\tilde{O}}(p^{g-1})\) | \({\tilde{O}}(\sqrt{p^{g-1}})\) |
Pairing inversion | \(L_p(1/3)\) | \(poly(\log p)\) |