{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T12:53:34Z","timestamp":1769864014868,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032155405","type":"print"},{"value":"9783032155412","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-15541-2_8","type":"book-chapter","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T20:07:44Z","timestamp":1769803664000},"page":"138-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Smaller Finite Fields for\u00a0More Efficient ZK-Friendly Hash Functions"],"prefix":"10.1007","author":[{"given":"G\u00f6k\u00e7e","family":"D\u00fczyol","sequence":"first","affiliation":[]},{"given":"Kamil","family":"Otal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., 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.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symmetric Cryptol. 2020(3), 1\u201345 (2020). https:\/\/doi.org\/10.13154\/TOSC.V2020.I3.1-45","DOI":"10.13154\/TOSC.V2020.I3.1-45"},{"key":"8_CR3","unstructured":"Ashur, T., Kindi, A., Mahzoun, M.: XHash8 and XHash12: efficient STARK-friendly hash functions. IACR Cryptology ePrint Archive, p.\u00a01045 (2023). https:\/\/eprint.iacr.org\/2023\/1045"},{"key":"8_CR4","unstructured":"Ashur, T., Mahzoun, M., Posen, J., Sijacic, D.: Vision mark-32: ZK-friendly hash function over binary tower fields. IACR Cryptology ePrint Archive, p.\u00a0633 (2024). https:\/\/eprint.iacr.org\/2024\/633"},{"issue":"2\u20133","key":"8_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/S10623-010-9391-Y","volume":"56","author":"PSLM Barreto","year":"2010","unstructured":"Barreto, P.S.L.M., Nikov, V., Nikova, S., Rijmen, V., Tischhauser, E.: Whirlwind: a new cryptographic hash function. Des. Codes Crypt. 56(2\u20133), 141\u2013162 (2010). https:\/\/doi.org\/10.1007\/S10623-010-9391-Y","journal-title":"Des. Codes Crypt."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-38348-9_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"G Bertoni","year":"2013","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 313\u2013314. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_19"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/S12095-018-0296-3","volume":"11","author":"J Boyar","year":"2019","unstructured":"Boyar, J., Find, M.G., Peralta, R.: Small low-depth, low-size circuits for cryptographic applications. Cryptogr. Commun. 11, 109\u2013127 (2019). https:\/\/doi.org\/10.1007\/S12095-018-0296-3","journal-title":"Cryptogr. Commun."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-85238-4_13","volume-title":"Mathematical Foundations of Computer Science 2008","author":"J Boyar","year":"2008","unstructured":"Boyar, J., Matthews, P., Peralta, R.: On the shortest linear straight-line program for computing linear forms. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 168\u2013179. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85238-4_13"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/S00145-012-9124-7","volume":"26","author":"J Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptol. 26(2), 280\u2013312 (2013). https:\/\/doi.org\/10.1007\/S00145-012-9124-7","journal-title":"J. Cryptol."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13193-6_16","volume-title":"Experimental Algorithms","author":"J Boyar","year":"2010","unstructured":"Boyar, J., Peralta, R.: A new combinational logic minimization technique with applications to cryptology. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 178\u2013189. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13193-6_16"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael - The Advanced Encryption Standard (AES). Information Security and Cryptography, 2nd Edn. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-662-60769-5","DOI":"10.1007\/978-3-662-60769-5"},{"key":"8_CR12","unstructured":"Gauravaram, P., et al.: Gr\u00f8stl - A SHA-3 candidate. In: Handschuh, H., Lucks, S., Preneel, B., Rogaway, P. (eds.) Symmetric Cryptography, 11.01.\u201316.01.2009. Dagstuhl Seminar Proceedings, vol. 09031. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2009). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1955\/"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Grassi, L., Khovratovich, D., L\u00fcftenegger, R., Rechberger, C., Schofnegger, M., Walch, R.: Monolith: circuit-friendly hash functions with new nonlinear layers for fast and constant-time implementations. IACR Trans. Symmetric Cryptol. 2024(3), 44\u201383 (2024). https:\/\/doi.org\/10.46586\/TOSC.V2024.I3.44-83","DOI":"10.46586\/TOSC.V2024.I3.44-83"},{"key":"8_CR14","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: POSEIDON: a new hash function for zero-knowledge proof systems. In: Bailey, M.D., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021, 11\u201313 August 2021, pp. 519\u2013535. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/grassi"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"779","DOI":"10.3934\/AMC.2019045","volume":"13","author":"KC Gupta","year":"2019","unstructured":"Gupta, K.C., Pandey, S.K., Ray, I.G., Samanta, S.: Cryptographically significant MDS matrices over finite fields: a brief survey and some generalized results. Adv. Math. Commun. 13(4), 779\u2013843 (2019). https:\/\/doi.org\/10.3934\/AMC.2019045","journal-title":"Adv. Math. Commun."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Ha, J., Hwang, S., Lee, J., Park, S., Son, M.: Polocolo: A ZK-friendly hash function based on S-boxes using power residues (full version). IACR Cryptology ePrint Archive, p.\u00a0926 (2025). https:\/\/eprint.iacr.org\/2025\/926","DOI":"10.1007\/978-3-031-91134-7_11"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Jean, J., Peyrin, T., Sim, S.M., Tourteaux, J.: Optimizing implementations of lightweight building blocks. IACR Trans. Symmetric Cryptol. 2017(4), 130\u2013168 (2017). https:\/\/doi.org\/10.13154\/TOSC.V2017.I4.130-168","DOI":"10.13154\/TOSC.V2017.I4.130-168"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-44709-3_24","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"K Khoo","year":"2014","unstructured":"Khoo, K., Peyrin, T., Poschmann, A.Y., Yap, H.: FOAM: searching for hardware-optimal SPN structures and components with a fair comparison. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 433\u2013450. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Kranz, T., Leander, G., Stoffelen, K., Wiemer, F.: Shorter linear straight-line programs for MDS matrices. IACR Trans. Symmetric Cryptol. 2017(4), 188\u2013211 (2017). https:\/\/doi.org\/10.13154\/TOSC.V2017.I4.188-211","DOI":"10.13154\/TOSC.V2017.I4.188-211"},{"issue":"4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1049\/IET-IFS.2017.0156","volume":"12","author":"M Kurt-Pehlivano\u011flu","year":"2018","unstructured":"Kurt-Pehlivano\u011flu, M., Sakall\u0131, M.T., Akleylek, S., Duru, N., Rijmen, V.: Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography. IET Inf. Secur. 12(4), 348\u2013355 (2018). https:\/\/doi.org\/10.1049\/IET-IFS.2017.0156","journal-title":"IET Inf. Secur."},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Li, S., Sun, S., Li, C., Wei, Z., Hu, L.: Constructing low-latency involutory MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 2019(1), 84\u2013117 (2019). https:\/\/doi.org\/10.13154\/TOSC.V2019.I1.84-117","DOI":"10.13154\/TOSC.V2019.I1.84-117"},{"key":"8_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and Their Applications","author":"R Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge, UK (1994)"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Lin, S.J., Chung, W.H., Han, Y.S.: Novel polynomial basis and its application to Reed-Solomon erasure codes. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 316\u2013325 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.41","DOI":"10.1109\/FOCS.2014.41"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-52993-5_6","volume-title":"Fast Software Encryption","author":"M Liu","year":"2016","unstructured":"Liu, M., Sim, S.M.: Lightweight MDS generalized circulant matrices. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 101\u2013120. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_6"},{"issue":"11","key":"8_CR25","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1007\/S10623-018-0458-5","volume":"86","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Rijmen, V., Leander, G.: Nonlinear diffusion layers. Des. Codes Cryptogr. 86(11), 2469\u20132484 (2018). https:\/\/doi.org\/10.1007\/S10623-018-0458-5","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR26","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland Publishing Co., Amsterdam-New York-Oxford (1977)"},{"key":"8_CR27","unstructured":"Otal, K.: A generalization of the subfield construction. Int. J. Inf. Secur. Sci. 11(2), 1\u201311 (2022). https:\/\/dergipark.org.tr\/en\/pub\/ijiss\/issue\/70915\/1104896"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Paar, C.: Optimized arithmetic for Reed-Solomon encoders. In: IEEE International Symposium on Information Theory (ISIT) 1997, p. 250. IEEE (1997)","DOI":"10.1109\/ISIT.1997.613165"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960). https:\/\/doi.org\/10.1137\/0108018","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Roth, R.M.: Introduction to Coding Theory. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511808968"},{"issue":"6","key":"8_CR31","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1109\/18.45291","volume":"35","author":"RM Roth","year":"1989","unstructured":"Roth, R.M., Lempel, A.: On MDS codes via Cauchy matrices. IEEE Trans. Inf. Theory 35(6), 1314\u20131319 (1989). https:\/\/doi.org\/10.1109\/18.45291","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"8_CR32","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/TIT.1985.1057113","volume":"31","author":"RM Roth","year":"1985","unstructured":"Roth, R.M., Seroussi, G.: On generator matrices of MDS codes. IEEE Trans. Inf. Theory 31(6), 826\u2013830 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057113","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-48116-5_23","volume-title":"Fast Software Encryption","author":"SM Sim","year":"2015","unstructured":"Sim, S.M., Khoo, K., Oggier, F., Peyrin, T.: Lightweight MDS involution matrices. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 471\u2013493. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_23"},{"key":"8_CR34","unstructured":"Szepieniec, A., Lemmens, A., Sauer, J.F., Threadbare, B.: The Tip5 hash function for recursive STARKs (2023). https:\/\/eprint.iacr.org\/2023\/107"},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.IPL.2018.04.010","volume":"137","author":"A Visconti","year":"2018","unstructured":"Visconti, A., Schiavo, C.V., Peralta, R.: Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). Inf. Process. Lett. 137, 1\u20135 (2018). https:\/\/doi.org\/10.1016\/J.IPL.2018.04.010","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Lightweight Cryptography for Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15541-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T20:07:46Z","timestamp":1769803666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15541-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032155405","9783032155412"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15541-2_8","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":"31 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LightSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Lightweight Cryptography for Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lightsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.encrypt-on.com\/activities\/conferences\/lightsec-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}