What you really care about for tree hashes is the block size to output ratio. SH... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		magila on Feb 26, 2017 \| parent \| context \| favorite \| on: Lessons from the History of Attacks on Secure Hash... What you really care about for tree hashes is the block size to output ratio. SHA-512/256 has a 1024 bit block size so it is less optimal than SHA-256, which has a 512 bit block size, for tree hashes. This is assuming you don't need any extra data in the internal nodes.

ribasushi on Feb 26, 2017 [–]

Could you expand on this comment and/or provide links to relevant reading?

Much appreciated!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact