Cryptanalysis of algebraic verifiable delay functions
DOI10.1007/978-3-031-68382-4_14MaRDI QIDQ6652907FDOQ6652907
Authors: Alex Biryukov, Ben Fisch, Gottfried Herold, Dmitry Khovratovich, Gaëtan Leurent, María Naya-Plasencia, Benjamin Wesolowski 
Publication date: 13 December 2024
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Software, source code, etc. for problems pertaining to number theory (11-04)
Cites Work
- Factoring integers with elliptic curves
- Multiplicative number theory. I. Classical theory
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Title not available (Why is that?)
- Two Fast GCD Algorithms
- Title not available (Why is that?)
- A Regular Layout for Parallel Adders
- Majority Gate Networks
- A Scheme for Fast Parallel Communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trustworthy public randomness with sloth, unicorn, and trx
- How to Generate Factored Random Numbers
- Title not available (Why is that?)
- Multiparty generation of an RSA modulus
- Verifiable delay functions from supersingular isogenies and pairings
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- Verifiable delay functions
- Simple verifiable delay functions
- Efficient verifiable delay functions
- Polylog depth circuits for integer factoring and discrete logarithms
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Publicly verifiable proofs of sequential work
- On the frequency of numbers containing prime factors of a certain relative magnitude.
- The full cost of cryptanalytic attacks
- Tight proofs of space and replication
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- PoSAT: proof-of-work availability and unpredictability, without the work
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Short-lived zero-knowledge proofs and signatures
- Nova: recursive zero-knowledge arguments from folding schemes
This page was built for publication: Cryptanalysis of algebraic verifiable delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652907)
