{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T12:31:46Z","timestamp":1786365106055,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354112","type":"print"},{"value":"9783032354129","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-35412-9_16","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T11:59:49Z","timestamp":1786363189000},"page":"471-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graeffe-Based Attacks on\u00a0Poseidon and\u00a0NTT Lower Bounds"],"prefix":"10.1007","author":[{"given":"Ziyu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Sanso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Vitto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jintai","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, A., Alpern, B., Chandra, A., Snir, M.: A model for hierarchical memory. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. pp. 305\u2013314. STOC \u201919, Association for Computing Machinery, New York, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28428","DOI":"10.1145\/28395.28428"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., et al.: Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC. In: Advances in Cryptology - ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, 8\u201312 December 2019, Proceedings, Part III, pp. 371\u2013397. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13","DOI":"10.1007\/978-3-030-34618-8_13"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In: Cheon, J.H., Takagi, T. (eds.) Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, 4\u20138 December 2016, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10031, pp. 191\u2013219 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7","DOI":"10.1007\/978-3-662-53887-6_7"},{"issue":"2\u20133","key":"16_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF01185206","volume":"12","author":"B Alpern","year":"1994","unstructured":"Alpern, B., Carter, L., Feig, E., Selker, T.: The uniform memory hierarchy model of computation. Algorithmica 12(2\u20133), 72\u2013109 (1994). https:\/\/doi.org\/10.1007\/BF01185206","journal-title":"Algorithmica"},{"key":"16_CR5","unstructured":"Aragon, N., Lavauzelle, J., Lequesne, M.: decodingchallenge.org (2019). http:\/\/decodingchallenge.org"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-981-97-5028-3_12","volume-title":"Information Security and Privacy","author":"T Ashur","year":"2024","unstructured":"Ashur, T., Buschman, T., Mahzoun, M.: Algebraic cryptanalysis of the hades design strategy: application to Poseidon and poseidon2. In: Zhu, T., Li, Y. (eds.) Information Security and Privacy, pp. 225\u2013244. Springer Nature Singapore, Singapore (2024)"},{"key":"16_CR7","unstructured":"Ashur, T., Dhooghe, S.: MARVELlous: a STARK-friendly family of cryptographic primitives. Cryptology ePrint Archive, Paper 2018\/1098 (2018). https:\/\/eprint.iacr.org\/2018\/1098"},{"key":"16_CR8","unstructured":"Ashur, T., Kindi, A., Meier, W., Szepieniec, A., Threadbare, B.: Rescue-Prime Optimized. Cryptology ePrint Archive, Paper 2022\/1577 (2022). https:\/\/eprint.iacr.org\/2022\/1577"},{"key":"16_CR9","unstructured":"Bak, A., Bariant, A., Boeuf, A., Briaud, P., \u00d8ygarden, M., Phanse, A.: The algebraic CheapLunch: Extending FreeLunch attacks on arithmetization-oriented primitives beyond CICO-1. Cryptology ePrint Archive, Paper 2025\/2040 (2025). https:\/\/eprint.iacr.org\/2025\/2040"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-032-01901-1_11","volume-title":"Advances in Cryptology - CRYPTO 2025","author":"A Bariant","year":"2025","unstructured":"Bariant, A., Boeuf, A., Briaud, P., Hostettler, M., \u00d8ygarden, M., Raddum, H.: Improved resultant attack against arithmetization-oriented primitives. In: Tauman Kalai, Y., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025, pp. 335\u2013367. Springer Nature Switzerland, Cham (2025)"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Bariant, A., et al.: The Algebraic FreeLunch: Efficient Gr\u00f6bner basis attacks against arithmetization-oriented primitives. In: Advances in Cryptology - CRYPTO 2024: 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part IV, pp. 139\u2013173. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68385-5_5","DOI":"10.1007\/978-3-031-68385-5_5"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Bariant, A., Bouvier, C., Leurent, G., Perrin, L.: Algebraic Attacks against Some Arithmetization-Oriented Primitives. IACR Trans. Symmetric Cryptol. 2022(3), 73\u2013101 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.73-101","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable Zero Knowledge with No Trusted Setup. In: Advances in Cryptology - CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2019, Proceedings, Part III, pp. 701\u2013732. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Kopparty, S., Levit, D.: Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields, pp. 700\u2013737. https:\/\/doi.org\/10.1137\/1.9781611977554.ch30","DOI":"10.1137\/1.9781611977554.ch30"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R.: Factoring Polynomials over large Finite Fields. In: Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation, p.\u00a0223. SYMSAC \u20191971, Association for Computing Machinery, New York, NY, USA (1971). https:\/\/doi.org\/10.1145\/800204.806290","DOI":"10.1145\/800204.806290"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Best, G.C.: Notes on the Graeffe Method of Root Squaring. American Math. Monthly 56(2), 91\u201394 (1949). http:\/\/www.jstor.org\/stable\/2306166","DOI":"10.2307\/2306166"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Beyne, T., et al.: Out of oddity - new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 299\u2013328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_11","DOI":"10.1007\/978-3-030-56877-1_11"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Brodetsky, S., Smeal, G.: On Graeffe\u2019s Method for Complex Roots of Algebraic Equations. Mathematical Proceedings of the Cambridge Philosoph. Soc. 22(2), 83\u201387 (1924). https:\/\/doi.org\/10.1017\/S0305004100002802","DOI":"10.1017\/S0305004100002802"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Buchberger, B.: Bruno Buchberger\u2019s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Sym. Comput. 41(3), 475\u2013511 (2006). https:\/\/doi.org\/10.1016\/j.jsc.2005.09.007. logic, Mathematics and Computer Science: Interactions in honor of Bruno Buchberger (60th birthday)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"16_CR20","unstructured":"Buchmann, J.A., Ding, J., Mohamed, M.S.E., Mohamed, W.S.A.E.: Mutantxl: Solving multivariate polynomial equations for cryptanalysis. In: Symmetric Cryptography (2009)"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"DG Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36, 587\u2013592 (1981)","journal-title":"Math. Comput."},{"key":"16_CR22","unstructured":"Ethereum Foundation: Poseidon cryptanalysis initiative 2024\u20132026 (2024). https:\/\/www.poseidon-initiative.info\/"},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner Bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993). https:\/\/doi.org\/10.1006\/jsco.1993.1051","journal-title":"J. Symb. Comput."},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(1), 61\u201388 (1999). https:\/\/doi.org\/10.1016\/S0022-4049(99)00005-5","journal-title":"J. Pure Appl. Algebra"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Grassi, L., Khovratovich, D., L\u00fcftenegger, R., Rechberger, C., Schofnegger, M., Walch, R.: Reinforced Concrete: A Fast Hash Function for Verifiable Computation. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 1323\u20131335. CCS \u20192022, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3560686","DOI":"10.1145\/3548606.3560686"},{"key":"16_CR26","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: A New Hash Function for Zero-Knowledge proof systems. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 519\u2013535. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/grassi"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Grassi, L., Khovratovich, D., Schofnegger, M.: Poseidon2: A Faster Version of the Poseidon Hash Function. Cryptology ePrint Archive, Paper 2023\/323 (2023). https:\/\/eprint.iacr.org\/2023\/323","DOI":"10.1007\/978-3-031-37679-5_8"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Grassi, L., Koschatko, K., Rechberger, C.: Poseidon and neptune: Gr\u00f6bner basis cryptanalysis exploiting subspace trails. IACR Trans. Symmetric Cryptol. 2025(2), 34\u201386 (2025). https:\/\/doi.org\/10.46586\/tosc.v2025.i2.34-86","DOI":"10.46586\/tosc.v2025.i2.34-86"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Grassi, L., L\u00fcftenegger, R., Rechberger, C., Rotaru, D., Schofnegger, M.: On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy. In: Advances in Cryptology - EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, 10\u201314 May 2020, Proceedings, Part II, pp. 674\u2013704. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_23","DOI":"10.1007\/978-3-030-45724-2_23"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Grassi, L., Onofri, S., Pedicini, M., Sozzi, L.: Invertible quadratic non-linear layers for mpc-\/fhe-\/zk-friendly schemes over FNP: application to Poseidon. IACR Trans. Symmetric Cryptol. 2022(3), 20\u201372 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.20-72","DOI":"10.46586\/tosc.v2022.i3.20-72"},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Grenet, B., van\u00a0der Hoeven, J., Lecerf, G.: Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms. In: Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation, pp. 197\u2013204. ISSAC \u20192015, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2755996.2756647","DOI":"10.1145\/2755996.2756647"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Grenet, B., Hoeven, J., Lecerf, G.: Deterministic root finding over finite fields using Graeffe transforms. Appl. Algebra Eng., Commun. Comput. 27(3), 237\u2013257 (2016). https:\/\/doi.org\/10.1007\/s00200-015-0280-5","DOI":"10.1007\/s00200-015-0280-5"},{"key":"16_CR33","unstructured":"van\u00a0der Hoeven, J.: Optimizing the half-GCD algorithm. ArXiv abs\/2212.12389 (2022). https:\/\/arxiv.org\/abs\/2212.12389"},{"key":"16_CR34","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-030-52200-1_48","volume-title":"Mathematical Software - ICMS 2020","author":"J van der Hoeven","year":"2020","unstructured":"van der Hoeven, J., Monagan, M.: Implementing the Tangent Graeffe Root Finding Method. In: Bigatti, A.M., Carette, J., Davenport, J.H., Joswig, M., de Wolff, T. (eds.) Mathematical Software - ICMS 2020, pp. 482\u2013492. Springer International Publishing, Cham (2020)"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Householder, A.S.: Dandelin, Lobacevskii, or Graeffe. American Math. Monthly 66(6), 464\u2013466 (1959). http:\/\/www.jstor.org\/stable\/2310626","DOI":"10.1080\/00029890.1959.11989328"},{"key":"16_CR36","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0052332","volume-title":"Fast Software Encryption","author":"T Jakobsen","year":"1997","unstructured":"Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) Fast Software Encryption, pp. 28\u201340. Springer, Berlin Heidelberg, Berlin, Heidelberg (1997)"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Jaques, S.: Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions. Fifth PQC Standardization Conference, NIST (2024). https:\/\/csrc.nist.gov\/csrc\/media\/Events\/2024\/fifth-pqc-standardization-conference\/documents\/papers\/memory-adds-no-cost.pdf","DOI":"10.62056\/ay4fbn2hd"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"Jia-Wei, H., Kung, H.T.: I\/O complexity: The red-blue pebble game. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing. pp. 326\u2013333. STOC \u20191981, Association for Computing Machinery, New York, NY, USA (1981). https:\/\/doi.org\/10.1145\/800076.802486","DOI":"10.1145\/800076.802486"},{"key":"16_CR39","doi-asserted-by":"publisher","unstructured":"Koschatko, K., L\u00fcftenegger, R., Rechberger, C.: Exploring the six worlds of gr\u00f6bner basis cryptanalysis: application to Anemoi. IACR Trans. Symmetric Cryptol. 2024(4), 138\u2013190 (2024). https:\/\/doi.org\/10.46586\/tosc.v2024.i4.138-190","DOI":"10.46586\/tosc.v2024.i4.138-190"},{"issue":"3","key":"16_CR40","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/1394608.1382159","volume":"36","author":"GH Loh","year":"2008","unstructured":"Loh, G.H.: 3D-stacked memory architectures for multi-core processors. SIGARCH Comput. Archit. News 36(3), 453\u2013464 (2008). https:\/\/doi.org\/10.1145\/1394608.1382159","journal-title":"SIGARCH Comput. Archit. News"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"MATZOV: Report on the Security of LWE: Improved Dual Lattice Attack (2022). https:\/\/doi.org\/10.5281\/zenodo.6412487","DOI":"10.5281\/zenodo.6412487"},{"key":"16_CR42","doi-asserted-by":"publisher","unstructured":"Moenck, R.T.: Fast computation of GCDs. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 142\u2013151. STOC \u20191973, Association for Computing Machinery, New York, NY, USA (1973). https:\/\/doi.org\/10.1145\/800125.804045","DOI":"10.1145\/800125.804045"},{"key":"16_CR43","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-14423-3_7","volume-title":"Information, Security and Cryptology - ICISC 2009","author":"MSE Mohamed","year":"2010","unstructured":"Mohamed, M.S.E., Cabarcas, D., Ding, J., Buchmann, J., Bulygin, S.: MXL3: an efficient algorithm for computing Gr\u00f6bner bases of zero-dimensional ideals. In: Lee, D., Hong, S. (eds.) Information, Security and Cryptology - ICISC 2009, pp. 87\u2013100. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"key":"16_CR44","unstructured":"NIST: FAQ on Kyber512 (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/post-quantum-cryptography\/documents\/faq\/Kyber-512-FAQ.pdf. Accessed: 09-May-2025"},{"issue":"2","key":"16_CR45","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(96)00030-8","volume":"162","author":"VY Pan","year":"1996","unstructured":"Pan, V.Y.: Parallel computation of polynomial GCD and some related parallel computations over abstract fields. Theoret. Comput. Sci. 162(2), 173\u2013223 (1996). https:\/\/doi.org\/10.1016\/0304-3975(96)00030-8","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR46","doi-asserted-by":"publisher","unstructured":"Puttaswamy, K., Loh, G.H.: Thermal herding: Microarchitecture techniques for controlling hotspots in high-performance 3D-integrated processors. In: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture, pp. 193\u2013204. HPCA \u20192007, IEEE Computer Society, USA (2007). https:\/\/doi.org\/10.1109\/HPCA.2007.346197","DOI":"10.1109\/HPCA.2007.346197"},{"key":"16_CR47","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-22685-4_12","volume-title":"Computing and Combinatorics","author":"D Ranjan","year":"2011","unstructured":"Ranjan, D., Savage, J., Zubair, M.: Strong I\/O lower bounds for binomial and FFT computation graphs. In: Fu, B., Du, D.Z. (eds.) Computing and Combinatorics, pp. 134\u2013145. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"key":"16_CR48","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/BFb0030842","volume-title":"Computing and Combinatorics","author":"JE Savage","year":"1995","unstructured":"Savage, J.E.: Extending the Hong-Kung model to memory hierarchies. In: Du, D.Z., Li, M. (eds.) Computing and Combinatorics, pp. 270\u2013281. Springer, Berlin Heidelberg, Berlin, Heidelberg (1995)"},{"key":"16_CR49","doi-asserted-by":"publisher","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7(3-4), 281\u2013292 (1971). https:\/\/doi.org\/10.1007\/BF02242355","DOI":"10.1007\/BF02242355"},{"key":"16_CR50","unstructured":"Szepieniec, A., Ashur, T., Dhooghe, S.: Rescue-Prime: a Standard Specification (SoK). Cryptology ePrint Archive, Paper 2020\/1143 (2020). https:\/\/eprint.iacr.org\/2020\/1143"},{"key":"16_CR51","doi-asserted-by":"publisher","unstructured":"Thompson, C.D.: A Complexity Theory for VLSI (1980). https:\/\/doi.org\/10.1184\/R1\/6714269.v1. https:\/\/kilthub.cmu.edu\/articles\/thesis\/A_Complexity_Theory_for_VLSI\/6714269","DOI":"10.1184\/R1\/6714269.v1"},{"key":"16_CR52","unstructured":"Victor Shoup: NTL - A library for doing numbery theory. https:\/\/github.com\/libntl\/ntl"},{"issue":"1","key":"16_CR53","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jpdc.1993.1008","volume":"17","author":"J Vitter","year":"1993","unstructured":"Vitter, J., Nodine, M.: Large-scale sorting in uniform memory hierarchies. J. Parallel Distributed Comput. 17(1), 107\u2013114 (1993). https:\/\/doi.org\/10.1006\/jpdc.1993.1008","journal-title":"J. Parallel Distributed Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35412-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T11:59:53Z","timestamp":1786363193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35412-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354112","9783032354129"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35412-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"11 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}