List of questions
Related questions
Question 56 - 212-81 discussion
A cryptographic hash function which uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 cycles per byte for MD6-256 on an Intel Core 2 Duo and provable resistance against differential cryptanalysis.
A.
TIGER
B.
GOST
C.
MD5
D.
MD6
Your answer:
0 comments
Sorted by
Leave a comment first