文章基本信息

标题：Low-Complexity Cryptographic Hash Functions
本地全文：下载
作者：Benny Applebaum ; Naama Haramaty-Krasne ; Yuval Ishai 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：67
页码：7:1-7:31
DOI：10.4230/LIPIcs.ITCS.2017.7
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Cryptography; hash functions; complexity theory; coding theory