%0 Journal Article
%T A New Derivation of the Leftover Hash Lemma
%J The ISC International Journal of Information Security
%I Iranian Society of Cryptology
%Z 2008-2045
%A S. Alencar, Marcelo
%A D. R. Assis, Karcius
%D 2020
%\ 11/03/2020
%V
%N
%P 55-58
%! A New Derivation of the Leftover Hash Lemma
%K Hash Lemma
%K Coding
%K probability
%R 10.22042/isecure.2021.271070.622
%X This paper reviews the characteristics of the main digest algorithms, and presents a new derivation of the leftover hash lemma, using the collision probability to derive an upper bound on the statistical distance between the key and seed joint probability, and the hash bit sequence distribution. The paper discussed the use of the hash function in cryptography and presented a new derivation of the upper bound on the statistical distance between the joint distribution of the key and the seed, and the distribution of the hash bit distribution, based on the collision probability. A cryptographic hash function is used to verify whether a data file maps onto a certain hash value. On the other hand, it is difficult to reconstruct the information based on the hash value. Therefore, it is used to assure data in- integrity, and is the building block of a Hash-based Message Authentication Code (HMAC), which provide message authentication.
%U http://www.isecure-journal.com/article_128715_5133b144bfcdb0722f89361ef4e70788.pdf