What is the difference between a multi-collision in a hash function and a first or second preimage. First preimage attacks: given a hash h, find a message m such that hash(m) = h. Second preimage attacks: given a fixed message m1, find a different message m2 such that hash(m2) = hash(m1). Multi-collision attacks: generate a series o...
I'm working on a project where I need to use some hash function to make a hash string. This hash string should be unique consists of 6 to 13 characters (fixed length). I use a database to store data, so for each record, I have a unique ID. I want to use this unique ID to make a hash string ( to achieve uniqueness of resulted hash string...
Is the security of the HMAC based on SHA-1 affected by the collisions attacks on SHA-1? ...
This isnt much of a programming question. its more of a reference question: does anyone know any programs/text files/whatever that show how the Tiger hash works? im trying to find some way to see the intermediate values of the hash. i found this website but the java implementation is weird and shows incorrect values despite getting prop...
I'm wondering what the serious issues are with the following setup: Username/password login scheme Javascript/ajax requests the salt value from the server (we have established in previous questions salt is not a secret value) Javascript preforms an SHA1 (or otherwise) of the password and salt. Javascript/ajax return the hash to the serv...
In the local object there is a collate facet. The collate facet has a hash method that returns a long. http://www.cplusplus.com/reference/std/locale/collate/hash/ Two questions: Does anybody know what hashing method is used. I need a 32bit value. If my long is longer than 32 bits, does anybody know about techniques for folding the ha...