Low-Complexity Cryptographic Hash Functions
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 effi...
Main Authors: | Applebaum, Benny, Haramaty-Krasne, Naama, Ishai, Yuval, Kushilevitz, Eyal, Vaikuntananthan, Vinod |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137816 |
Similar Items
-
Succinct Computational Secret Sharing
by: Applebaum, Benny, et al.
Published: (2023) -
Analysis of cryptographic hash functions
by: Guo, Jian
Published: (2011) -
Broad view of cryptographic hash functions
by: Alahmad, Mohammad, et al.
Published: (2013) -
Verification of Implementations of Cryptographic Hash Functions
by: Dexi Wang, et al.
Published: (2017-01-01) -
High Performance and Low Power Hardware Implementation for Cryptographic Hash Functions
by: Yunlong Zhang, et al.
Published: (2014-03-01)