2026-07-20T14:34:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8190 2024-03-06T10:39:16Z ddc:004 open_access

Low-Complexity Cryptographic Hash Functions Applebaum, Benny Haramaty-Krasne, Naama Ishai, Yuval Kushilevitz, Eyal Vaikuntanathan, Vinod Cryptography hash functions complexity theory coding theory Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benny Applebaum and Naama Haramaty-Krasne and Yuval Ishai and Eyal Kushilevitz and Vinod Vaikuntanathan 2017 Is Part Of LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITCS.2017.7 urn:nbn:de:0030-drops-81901 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.7 eng https://creativecommons.org/licenses/by/3.0/legalcode