|
|
|
|
a new derivation of the leftover hash lemma
|
|
|
|
|
|
|
|
نویسنده
|
alencar marcelo s. ,assis karcius d. r.
|
|
منبع
|
the isc international journal of information security - 2020 - دوره : 12 - شماره : 3 - صفحه:55 -58
|
|
چکیده
|
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.
|
|
کلیدواژه
|
hash lemma ,coding ,probability
|
|
آدرس
|
federal university of bahia, institute for advanced studies in communications (iecom), brazil, federal university of bahia, institute of advanced studies in communications, brazil
|
|
پست الکترونیکی
|
karcius.assis@ufba.br
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|