{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:00:00Z","timestamp":1778662800316,"version":"3.51.4"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2017,9,1]]},"DOI":"10.1109\/tc.2017.2693185","type":"journal-article","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T18:31:25Z","timestamp":1492021885000},"page":"1585-1598","source":"Crossref","is-referenced-by-count":14,"title":["Optimization of Tree Modes for Parallel Hash Functions: A Case Study"],"prefix":"10.1109","volume":"66","author":[{"given":"Kevin","family":"Atighehchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Rolland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0175-4"},{"key":"ref38","article-title":"Tree hashing: A simple generic tree hashing mode designed for SHA-2 and SHA-3, applicable to other hash functions","author":"lucks","year":"2013","journal-title":"Early Symmetric Crypto (ESC) Seminar"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277897"},{"key":"ref32","first-page":"3","author":"williams","year":"2005","journal-title":"Web Workload Characterization Ten Years Later"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/65.642356"},{"key":"ref30","author":"gibbons","year":"1988","journal-title":"Efficient Parallel Algorithms"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v032.i10","article-title":"The VGAM package for categorical data analysis","volume":"32","author":"yee","year":"2010","journal-title":"J Statist Softw"},{"key":"ref36","year":"2014","journal-title":"R A Language and Environment for Statistical Computing"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762486"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2004.11.001"},{"key":"ref10","article-title":"SHA-3 derived functions: cSHAKE, KMAC, TupleHash and Parallel-Hash","year":"2016","journal-title":"NIST Special Publication"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45311-3_4"},{"key":"ref12","article-title":"A parallelizable design principle for cryptographic hash functions","volume":"2002","author":"sarkar","year":"2002","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39887-5_25"},{"key":"ref14","article-title":"Sufficient conditions for sound tree and sequential hashing modes","volume":"2009","author":"bertoni","year":"2009","journal-title":"Cryptology ePrint Archive"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-319-07536-5_14","article-title":"Sakura: A flexible coding for tree hashing","author":"bertoni","year":"2014","journal-title":"Proc 3rd Int Conf Appl Cryptogr Netw Secur"},{"key":"ref16","article-title":"Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256","volume":"2014","author":"gueron","year":"2014","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref17","first-page":"430","article-title":"Merkle-Damgård revisited: How to construct a hash function","author":"coron","year":"2005","journal-title":"Proc 25th Annu Int Cryptology Conf Advances Cryptology"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0219049"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185395"},{"key":"ref28","first-page":"181","article-title":"On the indifferentiability of the sponge construction","author":"bertoni","year":"2008","journal-title":"Proc 27th Annu Int Conf Advances Cryptology Theory Appl Cryptographic Techn"},{"key":"ref4","article-title":"Secrecy, authentication, and public key systems","author":"merkle","year":"1979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_31"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_39"},{"key":"ref6","article-title":"The skein hash function family","author":"ferguson","year":"2009"},{"key":"ref29","first-page":"313","article-title":"Keccak","author":"bertoni","year":"2013","journal-title":"Proc 32nd Annu Int Conf Theory Appl Cryptographic Techn Advances Cryptology"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1980.10006"},{"key":"ref8","article-title":"The MD6 hash function: A proposal to NIST for SHA-3","author":"rivest","year":"2008"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-642-38980-1_8","article-title":"BLAKE2: Simpler, smaller, fast as MD5","author":"aumasson","year":"2013","journal-title":"Proc 11th Int Conf Appl Cryptogr Netw Secur"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4236\/jis.2012.34039"},{"key":"ref9","article-title":"KangarooTwelve: Fast hashing based on Keccak-p","volume":"2016","author":"bertoni","year":"2016","journal-title":"Cryptology ePrint Archive"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-012-0037-z"},{"key":"ref20","first-page":"251","article-title":"Fast exponentiation in GF($2^{\\text{n}}$ )","author":"agnew","year":"1988","journal-title":"Proc Workshop Theory Appl Cryptographic Techn Advances Cryptology"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"445","DOI":"10.15388\/Informatica.2006.148","article-title":"Fast parallel exponentiation algorithm for RSA public-key cryptosystem","volume":"17","author":"wu","year":"2006","journal-title":"Informatica"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.06.005"},{"key":"ref24","article-title":"Security reductions of the second round SHA-3 candidates","volume":"2010","author":"andreeva","year":"2010","journal-title":"Cryptology ePrint Archive"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-013-0220-y"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_19"},{"key":"ref25","first-page":"39","article-title":"Security reductions of the second round SHA-3 candidates","author":"andreeva","year":"2010","journal-title":"Proc 13th Int Conf Inf Security"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8003558\/07896557.pdf?arnumber=7896557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:40:16Z","timestamp":1642005616000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7896557\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,1]]},"references-count":39,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2017.2693185","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2017,9,1]]}}}