Cryptanalysis of algebraic verifiable delay functions

DOI10.1007/978-3-031-68382-4_14MaRDI QIDQ6652907

Benjamin Wesolowski, Gottfried Herold, Dmitry Khovratovich, María Naya-Plasencia, Ben Fisch, Alex Biryukov, Gaëtan Leurent

Publication date: 13 December 2024

zbMATH Keywords

smoothnesscryptanalysisverifiable delay functionsMinRootSloth++Veedo

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Polylog depth circuits for integer factoring and discrete logarithms
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Trustworthy public randomness with sloth, unicorn, and trx
• Verifiable delay functions
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• On the frequency of numbers containing prime factors of a certain relative magnitude.
• The full cost of cryptanalytic attacks
• 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
• Verifiable delay functions from supersingular isogenies and pairings
• Tight proofs of space and replication
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Publicly verifiable proofs of sequential work
• How to Generate Factored Random Numbers
• A Regular Layout for Parallel Adders
• A Scheme for Fast Parallel Communication
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Two Fast GCD Algorithms
• Simple verifiable delay functions
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Majority Gate Networks
• Multiparty generation of an RSA modulus
• Efficient verifiable delay functions
• 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