{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:22:36Z","timestamp":1774120956835,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T00:00:00Z","timestamp":1736553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>\n            The global paradigm shift toward edge computing has led to a growing demand for efficient integrity verification. Hash functions are one-way algorithms which act as a zero-knowledge proof of a datum\u2019s contents. However, it is infeasible to compute hashes on devices with limited processing power and memory. Hence, we propose four novel\n            <jats:italic>LiteHash<\/jats:italic>\n            functions which are architecturally similar to SHA-512 yet simpler. By using various approximation techniques, our implementations reduce the computational costs of digesting a message into a hash. On validating our proposed designs using the NIST PRNG Test Suite, we observe SHA-512 equivalent cryptographic security while satisfying all desired hash function property requirements. We observe a minimum of 9.41% reduction in area, 20.47% reduction in power, and 22.05% increase in throughput. Our designs offer a throughput of up to 2 Gbps while reducing area and power by a maximum of 16.86% and 32.48%, respectively.\n            <jats:italic>LiteHash<\/jats:italic>\n            functions also support the computation of the entire SHA-2 family of hash functions (SHA-224\/256\/384\/512) with minor architectural modifications.\n          <\/jats:p>","DOI":"10.1145\/3677181","type":"journal-article","created":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T11:36:57Z","timestamp":1720525017000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["LiteHash: Hash Functions for Resource-Constrained Hardware"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0344-885X","authenticated-orcid":false,"given":"Sagar Dev","family":"Achar","sequence":"first","affiliation":[{"name":"JSS Academy of Technical Education, Bangalore, India"}]},{"given":"Thejaswini","family":"P","sequence":"additional","affiliation":[{"name":"JSS Academy of Technical Education, Bangalore, India"}]},{"given":"Sukumar","family":"Nandi","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Guwahati, Guwahati, India"}]},{"given":"Sunit","family":"Nandi","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Guwahati, Guwahati, India"}]}],"member":"320","published-online":{"date-parts":[[2025,1,11]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40031-019-00418-8"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Lawrence Bassham Andrew Rukhin Juan Soto James Nechvatal Miles Smid Stefan Leigh M. Levenson M. Vangel Nathanael Heckert and D. Banks. 2010. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST.","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID51830.2021.00013"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2000450"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS45731.2020.9181065"},{"key":"e_1_3_2_7_2","unstructured":"Jung Hee Cheon Andrey Kim Miran Kim and Yongsoo Song. 2016. Homomorphic Encryption for Arithmetic of Approximate Numbers. Paper 2016\/421. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2016\/421"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2004.1269207"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2871096"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/RADIOELEK.2016.7477392"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3136825.3136858"},{"key":"e_1_3_2_12_2","article-title":"Technology insight: Edge computing in support of the Internet of Things","author":"Rao. Bob Gill and Santhosh","year":"2017","unstructured":"Bob Gill and Santhosh Rao.2017. Technology insight: Edge computing in support of the Internet of Things. Gartner Research. Retrieved July 11, 2024 from https:\/\/www.gartner.com\/en\/documents\/3759476","journal-title":"Gartner Research."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2017.176"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Ga\u00ebtan Leurent and Thomas Peyrin. 2019. From Collisions to Chosen-Prefix Collisions\u2014Application to Full SHA-1. Paper 2019\/459. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2019\/459","DOI":"10.1007\/978-3-030-17659-4_18"},{"key":"e_1_3_2_15_2","unstructured":"Ga\u00ebtan Leurent and Thomas Peyrin. 2020. SHA-1 Is a Shambles\u2014First Chosen-Prefix Collision on SHA-1 and Application to the PGP Web of Trust. Paper 2020\/014. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2020\/014"},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-540-24660-2_25","volume-title":"Topics in Cryptology\u2014CT-RSA 2004","author":"Lien Roar","year":"2004","unstructured":"Roar Lien, Tim Grembowski, and Kris Gaj. 2004. A 1 Gbit\/s partially unrolled architecture of hash functions SHA-1 and SHA-512. In Topics in Cryptology\u2014CT-RSA 2004, Tatsuaki Okamoto (Ed.). Springer, Berlin, Germany, 324\u2013338."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3030121"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2636128"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00193563"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2006.70"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2008.15"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Sparsh Mittal. 2016. A survey of techniques for approximate computing. ACM Computing Surveys 48 4 (March 2016) Article 62 33 pages. DOI:10.1145\/2893356","DOI":"10.1145\/2893356"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2308214"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Testing (NIST). 2015. Secure Hash Standard (SHS). NIST. DOI:10.6028\/NIST.FIPS.180-4","DOI":"10.6028\/NIST.FIPS.180-4"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISED.2017.8303943"},{"key":"e_1_3_2_26_2","unstructured":"Frederik Pfautsch Nils Schubert Conrad Orglmeister Maximilian Gebhart Philipp Habermann and Ben H. H. Juurlink. 2020. The evolution of secure hash algorithms. In Proceedings of the 28th PARS Workshop. 1\u201311."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3146148"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3243497"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITCC.2005.92"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2657799"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/54.655179"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW55747.2022.00031"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3677181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:17Z","timestamp":1750291577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3677181"],"URL":"https:\/\/doi.org\/10.1145\/3677181","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,11]]},"assertion":[{"value":"2023-11-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-05","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}