{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:42:34Z","timestamp":1780069354317,"version":"3.54.0"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683817","type":"print"},{"value":"9783031683824","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68382-4_14","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:02:41Z","timestamp":1723712561000},"page":"457-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cryptanalysis of\u00a0Algebraic Verifiable Delay Functions"],"prefix":"10.1007","author":[{"given":"Alex","family":"Biryukov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Fisch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gottfried","family":"Herold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitry","family":"Khovratovich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ga\u00ebtan","family":"Leurent","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mar\u00eda","family":"Naya-Plasencia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Wesolowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Adleman, L.M.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography (abstract). In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 29-31 October 1979, pp. 55\u201360. IEEE Computer Society (1979). https:\/\/doi.org\/10.1109\/SFCS.1979.2","DOI":"10.1109\/SFCS.1979.2"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Adleman, L.M., Kompella, K.: Using smoothness to achieve parallelism (abstract). In: 20th ACM STOC, pp. 528\u2013538. ACM Press (May 1988). https:\/\/doi.org\/10.1145\/62212.62264","DOI":"10.1145\/62212.62264"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Adrian, D., et al.: Imperfect forward secrecy: How Diffie-Hellman fails in practice. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 5\u201317. ACM Press (Oct 2015). https:\/\/doi.org\/10.1145\/2810103.2813707","DOI":"10.1145\/2810103.2813707"},{"key":"14_CR4","unstructured":"Ahrens, K., Zumbr\u00e4gel, J.: DEFEND: towards verifiable delay functions from endomorphism rings. In: IACR Cryptol. ePrint Arch, p.\u00a01537 (2023). https:\/\/eprint.iacr.org\/2023\/1537"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-031-22969-5_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part III","author":"A Arun","year":"2022","unstructured":"Arun, A., Bonneau, J., Clark, J.: Short-lived Zero-Knowledge Proofs and\u00a0Signatures. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part III, pp. 487\u2013516. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_17"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Atabaki, A.H., et al.: Integrating photonics with silicon nanoelectronics for the next generation of systems on a chip. Nature 556(7701), 349\u2013354 (2018). https:\/\/doi.org\/10.1038\/s41586-018-0028-z","DOI":"10.1038\/s41586-018-0028-z"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bach, E.: How to generate factored random numbers. SIAM J. Comput. 17(2), 179\u2013193 (1988). https:\/\/doi.org\/10.1137\/0217012","DOI":"10.1137\/0217012"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"P Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_24"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Biryukov, A., et al.: Cryptanalysis of algebraic verifiable delay functions. Cryptology ePrint Archive (2024), full version","DOI":"10.1007\/978-3-031-68382-4_14"},{"key":"14_CR10","unstructured":"Blum, M.: Coin flipping by telephone. In: Proceedings of the IEEE Spring COMPCOM, pp. 133\u2013137 (1982)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I, pp. 757\u2013788. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.K.: Efficient generation of shared RSA keys (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO\u201997. LNCS, vol.\u00a01294, pp. 425\u2013439. Springer, Heidelberg (Aug 1997). https:\/\/doi.org\/10.1007\/BFb0052253","DOI":"10.1007\/BFb0052253"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Brent, R.P., Kung, H.T.: A regular layout for parallel adders. IEEE Trans. Comput. 31(3), 260\u2013264 (1982). https:\/\/doi.org\/10.1109\/TC.1982.1675982","DOI":"10.1109\/TC.1982.1675982"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Rung, H.: A systolic algorithm for integer GCD computation. In: 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), pp. 118\u2013125. IEEE (1985)","DOI":"10.1109\/ARITH.1985.6158931"},{"key":"14_CR15","unstructured":"Buterin, V.: Randao++. https:\/\/redd.it\/4mdkku (2017)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-56877-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III","author":"M Chen","year":"2020","unstructured":"Chen, M., et al.: Multiparty generation of an RSA modulus. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III, pp. 64\u201393. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_3"},{"key":"14_CR17","unstructured":"Cline, D., Dryja, T., Narula, N., CommitO: Clockwork: An exchange protocol for proofs of non front-running (2020)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s001450010002","volume":"13","author":"D Coppersmith","year":"2000","unstructured":"Coppersmith, D., Shparlinski, I.: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. J. Cryptol. 13, 339\u2013360 (2000)","journal-title":"J. Cryptol."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part I","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part I, pp. 248\u2013277. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-662-64331-0_6","volume-title":"Financial Cryptography and Data Security: 25th International Conference, FC 2021, Virtual Event, March 1\u20135, 2021, Revised Selected Papers, Part II","author":"S Deb","year":"2021","unstructured":"Deb, S., Kannan, S., Tse, D.: PoSAT: proof-of-work availability and unpredictability, without the work. In: Borisov, N., Diaz, C. (eds.) Financial Cryptography and Data Security: 25th International Conference, FC 2021, Virtual Event, March 1\u20135, 2021, Revised Selected Papers, Part II, pp. 104\u2013128. Springer Berlin Heidelberg, Berlin, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_6"},{"key":"14_CR21","unstructured":"Dickman, K.: On the frequency of numbers containing prime factors of a certain relative magnitude. Arkiv for matematik, astronomi och fysik 22(10), A\u201310 (1930)"},{"key":"14_CR22","unstructured":"Dobson, S., Galbraith, S.D., Smith, B.A.: Trustless unknown-order groups. ArXiv:abs\/2211.16128, https:\/\/api.semanticscholar.org\/CorpusID:236932351 (2022)"},{"key":"14_CR23","unstructured":"Drake, J.: Minimal vdf randomness beacon. https:\/\/ethresear.ch\/t\/ minimal-vdf-randomness-beacon\/3566 (2018)"},{"issue":"10","key":"14_CR24","first-page":"909","volume":"7","author":"J Earle","year":"1965","unstructured":"Earle, J.: Latched carry-save adder. IBM Tech. Disclosure Bull. 7(10), 909\u2013910 (1965)","journal-title":"IBM Tech. Disclosure Bull."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-030-17656-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Fisch","year":"2019","unstructured":"Fisch, B.: Tight proofs of space and replication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 324\u2013348. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_12"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Gordon, D.M.: Discrete logarithms in GF(P) using the number field sieve. SIAM J. Discret. Math. 6(1), 124\u2013138 (1993). https:\/\/doi.org\/10.1137\/0406010","DOI":"10.1137\/0406010"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T., Nicolosi, A.A.: Efficient RSA key generation and threshold paillier in the two-party setting. J. Cryptol. 32(2), 265\u2013323 (Apr2019). https:\/\/doi.org\/10.1007\/s00145-017-9275-7","DOI":"10.1007\/s00145-017-9275-7"},{"key":"14_CR28","unstructured":"Herold, G., et al.: Statement regarding the public report on the analysis of minroot. https:\/\/ethresear.ch\/t\/statement-regarding-the-public-report-on-the-analysis-of-minroot\/16670 (Sep 2023)"},{"key":"14_CR29","unstructured":"Khovratovich, D., Maller, M., Tiwari, P.R.: MinRoot: Candidate sequential function for ethereum VDF. Cryptology ePrint Archive, Report 2022\/1626 (2022). https:\/\/eprint.iacr.org\/2022\/1626"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20\u201324, 2017, Proceedings, Part I","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology \u2013 CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20\u201324, 2017, Proceedings, Part I, pp. 357\u2013388. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-031-15985-5_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part IV","author":"A Kothapalli","year":"2022","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part IV, pp. 359\u2013388. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13"},{"key":"14_CR32","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015\/366 (2015). https:\/\/eprint.iacr.org\/2015\/366"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Wesolowski, B.: Trustworthy public randomness with sloth, unicorn, and trx. Int. J. Appl. Cryptogr. 3(4), 330\u2013343 (2017) https:\/\/doi.org\/10.1504\/IJACT.2017.10010315","DOI":"10.1504\/IJACT.2017.10010315"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649\u2013673 (1987). http:\/\/www.jstor.org\/stable\/1971363","DOI":"10.2307\/1971363"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Kleinberg, R.D. (ed.) ITCS 2013, pp. 373\u2013388. ACM (Jan 2013). https:\/\/doi.org\/10.1145\/2422436.2422479","DOI":"10.1145\/2422436.2422479"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Smith, C., Wu, D.J.: Can verifiable delay functions be based on random oracles? In: Czumaj, A., Dawar, A., Merelli, E. (eds.) ICALP 2020. LIPIcs, vol.\u00a0168, pp. 83:1\u201383:17. Schloss Dagstuhl (Jul 2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.83","DOI":"10.4230\/LIPIcs.ICALP.2020.83"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Medley, L., Loe, A.F., Quaglia, E.A.: Sok: Delay-based cryptography. In: 36th IEEE Computer Security Foundations Symposium, CSF 2023, Dubrovnik, Croatia, July 10-14, 2023, pp. 169\u2013183. IEEE (2023). https:\/\/doi.org\/10.1109\/CSF57540.2023.00028","DOI":"10.1109\/CSF57540.2023.00028"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Montgomery, H.L., Vaughan, R.C.: Multiplicative number theory I: Classical theory. No.\u00a097, Cambridge university press (2007)","DOI":"10.1017\/CBO9780511618314"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) ITCS 2019. vol.\u00a0124, pp. 60:1\u201360:15. LIPIcs (Jan 2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.60","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over gf(p) and its cryptographic significance (corresp.). IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055817","DOI":"10.1109\/TIT.1978.1055817"},{"key":"14_CR41","volume-title":"Time-lock Puzzles and Timed-release Crypto","author":"RL Rivest","year":"1996","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock Puzzles and Timed-release Crypto. Technical Report, Massachusetts Institute of Technology (1996)"},{"key":"14_CR42","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-56877-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G.: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III, pp. 481\u2013509. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_17"},{"key":"14_CR43","volume-title":"Models of Computation","author":"JE Savage","year":"1998","unstructured":"Savage, J.E.: Models of Computation, vol. 136. Addison-Wesley Reading, MA (1998)"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Schindler, P., Judmayer, A., Hittmeir, M., Stifter, N., Weippl, E.R.: RandRunner: Distributed randomness from trapdoor VDFs with strong uniqueness. In: NDSS\u00a02021. The Internet Society (Feb 2021)","DOI":"10.14722\/ndss.2021.24116"},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-48059-5_2","volume-title":"Cryptographic Hardware and Embedded Systems: First InternationalWorkshop, CHES\u201999 Worcester, MA, USA, August 12\u201313, 1999 Proceedings","author":"A Shamir","year":"1999","unstructured":"Shamir, A.: Factoring large numbers with the TWINKLE Device: (extended abstract). In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems: First InternationalWorkshop, CHES\u201999 Worcester, MA, USA, August 12\u201313, 1999 Proceedings, pp. 2\u201312. Springer Berlin Heidelberg, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_2"},{"key":"14_CR46","unstructured":"Shani, B.: A note on isogeny-based hybrid verifiable delay functions. Cryptology ePrint Archive, Report 2019\/205 (2019). https:\/\/eprint.iacr.org\/2019\/205"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Proceedings of the Symp. Math. Soc., 1971. vol.\u00a020, pp. 415\u2013440 (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"14_CR48","unstructured":"Shparlinski, I.: Number theoretic methods in cryptography: Complexity lower bounds, vol.\u00a017. Birkh\u00e4user (2012)"},{"issue":"1","key":"14_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1021","volume":"110","author":"J Sorenson","year":"1994","unstructured":"Sorenson, J.: Polylog depth circuits for integer factoring and discrete logarithms. Inf. Comput. 110(1), 1\u201318 (1994)","journal-title":"Inf. Comput."},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Sorenson, J.: Two fast GCD algorithms. J. Algorithms 16(1), 110\u2013144 (1994). https:\/\/doi.org\/10.1006\/jagm.1994.1006","DOI":"10.1006\/jagm.1994.1006"},{"key":"14_CR51","doi-asserted-by":"publisher","unstructured":"Sreedhar, K., Horowitz, M., Torng, C.: A fast large-integer extended GCD algorithm and hardware design for verifiable delay functions and modular inversion. IACR TCHES 2022(4), 163\u2013187 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.163-187","DOI":"10.46586\/tches.v2022.i4.163-187"},{"key":"14_CR52","unstructured":"StarkWare: Presenting: VeeDo. https:\/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae (2020)"},{"key":"14_CR53","unstructured":"Supranational LLC: MinRoot VDF Hardware Engine (2022). https:\/\/github.com\/supranational\/minroot_hardware"},{"key":"14_CR54","unstructured":"Supranational LLC: Minroot ASIC Driver (2023). https:\/\/github.com\/supranational\/minroot_driver"},{"key":"14_CR55","unstructured":"Supranational LLC: MinRoot VDF ASIC (2023). private presentation"},{"key":"14_CR56","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: A scheme for fast parallel communication. SIAM J. Comput. 11(2), 350\u2013361 (1982). https:\/\/doi.org\/10.1137\/0211027","DOI":"10.1137\/0211027"},{"key":"14_CR57","doi-asserted-by":"crossref","unstructured":"Wallace, C.S.: A suggestion for a fast multiplier. IEEE Trans. Electron. Comput. 13(1), 14\u201317 (1964). https:\/\/doi.org\/10.1109\/PGEC.1964.263830","DOI":"10.1109\/PGEC.1964.263830"},{"key":"14_CR58","doi-asserted-by":"publisher","unstructured":"Wang, P.S.: A p-adic algorithm for univariate partial fractions. In: Wang, P.S. (ed.) Proceedings of the Symposium on Symbolic and Algebraic Manipulation, SYMSAC 1981, Snowbird, Utah, USA, August 5-7, 1981, pp. 212\u2013217. ACM (1981). https:\/\/doi.org\/10.1145\/800206.806398","DOI":"10.1145\/800206.806398"},{"key":"14_CR59","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part III","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part III, pp. 379\u2013407. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"},{"issue":"2","key":"14_CR60","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00145-003-0213-5","volume":"17","author":"MJ Wiener","year":"2004","unstructured":"Wiener, M.J.: The full cost of cryptanalytic attacks. J. Cryptol. 17(2), 105\u2013124 (2004). https:\/\/doi.org\/10.1007\/s00145-003-0213-5","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68382-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:04:34Z","timestamp":1732647874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68382-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683817","9783031683824"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68382-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}