A comprehensive review on collision-resistant hash functions on lattices
| Autor: | SK Hafizul Islam, Nimish Mishra, Sherali Zeadally |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Theoretical computer science
Cryptographic primitive Computer Networks and Communications Computer science business.industry Hash function 020206 networking & telecommunications Cryptography 0102 computer and information sciences 02 engineering and technology Collision 01 natural sciences 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Ideal (order theory) Quantum algorithm Computational problem Mathematical structure Safety Risk Reliability and Quality business Software Computer Science::Cryptography and Security |
| Zdroj: | Journal of Information Security and Applications. 58:102782 |
| ISSN: | 2214-2126 |
| Popis: | Hash functions have always attracted a lot of attention in modern cryptography because of their hard to invert nature. However, all previous constructions of cryptographic primitives face the threat of being broken by the recent advancements in quantum technology. The focus has thus shifted to developing cryptographic primitives on mathematical structures such as lattices that are intractable by quantum algorithms. We review the computational problems defined on lattices and their respective hardness and discuss constructions of hash function families based on both integer and ideal lattices whose security depends on these computational problems on lattices. We provide a comparative analysis of the theoretical security and concrete instantiations claimed by the different hash function families. Finally, we review techniques used in the reductions for the security proofs of constructions of different hash function families. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect