6 reputation
2
bio website
location
age
visits member for 7 months
seen Dec 13 '13 at 18:56

Dec
13
comment collision resistant summarizer for long hash values
do you mean if message if short like a domain name (e.g google.com) there is a way to use a short collision resistant hash? sounds good tell me more about invertable function for SHA-256 please
Dec
12
awarded  Student
Dec
12
comment collision resistant summarizer for long hash values
so chaining hashes don't add any security to our design and collision attack is still 2^64 right? we need 2^128 operation at least. what about use KDF on hash?
Dec
12
comment collision resistant summarizer for long hash values
is there any way to increase entropy of our hash against collisions e.g by chaining hash operations? for example compute SHA512(M)=hash1 then compute SHA256(hash1)=hash2 then compute SHA256(hash2)=hash3 then truncate hash3 to 128 bits by XORing it? how much entropy this add and how many chain we need?
Dec
12
awarded  Editor
Dec
12
asked collision resistant summarizer for long hash values