Cryptanalysis of algebraic verifiable delay functions

DOI10.1007/978-3-031-68382-4_14MaRDI QIDQ6652907zbMATH OpenFDO

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

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68382-4_14

zbMATH Keywords

cryptanalysisMinRootSloth++smoothnessVeedoverifiable delay functions

Mathematics Subject Classification ID

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

Recommendations

• Verifiable delay functions from supersingular isogenies and pairings
• Verifiable delay functions
• Tight verifiable delay functions
• Simple verifiable delay functions
• Efficient verifiable delay functions

Cites work

• 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.)
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient verifiable delay functions
• Factoring integers with elliptic curves
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• How to Generate Factored Random Numbers
• scientific article; zbMATH DE number 3765126 (Why is no real title available?)
• scientific article; zbMATH DE number 1033441 (Why is no real title available?)
• scientific article; zbMATH DE number 1088251 (Why is no real title available?)
• scientific article; zbMATH DE number 1504795 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Majority Gate Networks
• Multiparty generation of an RSA modulus
• Multiplicative number theory. I. Classical theory
• Nova: recursive zero-knowledge arguments from folding schemes
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• On the frequency of numbers containing prime factors of a certain relative magnitude.
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Polylog depth circuits for integer factoring and discrete logarithms
• PoSAT: proof-of-work availability and unpredictability, without the work
• Publicly verifiable proofs of sequential work
• Short-lived zero-knowledge proofs and signatures
• Simple verifiable delay functions
• The full cost of cryptanalytic attacks
• Tight proofs of space and replication
• Trustworthy public randomness with sloth, unicorn, and trx
• Two Fast GCD Algorithms
• Verifiable delay functions
• Verifiable delay functions from supersingular isogenies and pairings

Cited in

(1)

• Time/space tradeoffs for generic attacks on delay functions

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)