![]() |
Cryptographic Hash Functions from Expander Graphs, M.Sc. Thesis Sharif University of Technology ; khazaei, Shahram (Supervisor)
Abstract
A hash function maps efficiently every finite length string to a fixed one. The output represents the entire content of the input, similar to digital fingerprint of input text. In order to be able to use a hash function in cryptography, it should be hard to find two distinct inputs with the same output (collision), because finding a collision in hash functions leads to malicious attacks on many security systems.We say a hash function is provably collision resistant, if finding a collision can be reduced to the known hard problems. Family of MD hash functions are one of the most famous applied hash functions which are considerably used in industrial applications. However, they are not...
Cataloging briefCryptographic Hash Functions from Expander Graphs, M.Sc. Thesis Sharif University of Technology ; khazaei, Shahram (Supervisor)
Abstract
A hash function maps efficiently every finite length string to a fixed one. The output represents the entire content of the input, similar to digital fingerprint of input text. In order to be able to use a hash function in cryptography, it should be hard to find two distinct inputs with the same output (collision), because finding a collision in hash functions leads to malicious attacks on many security systems.We say a hash function is provably collision resistant, if finding a collision can be reduced to the known hard problems. Family of MD hash functions are one of the most famous applied hash functions which are considerably used in industrial applications. However, they are not...
Find in contentBookmark |
![]() |
|