Title of article :
A New Derivation of the Leftover Hash Lemma
Author/Authors :
Alencar ، Marcelo S. Institute for Advanced Studies in Communications (Iecom) - Federal University of Bahia , Assis ، Karcius D. R. Institute of Advanced Studies in Communications - Federal University of Bahia
Abstract :
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.
Keywords :
Hash Lemma , Coding , probability
Journal title :
ISeCure - The ISC International Journal of Information Security
Journal title :
ISeCure - The ISC International Journal of Information Security
