Abstract
We study higher order eTCR (enhanced target collision resistance) hash functions, where rth-order eTCR is denoted by eTCR(r). We prove that a few rounds of the MD (Merkle–Damgård) scheme and a few levels of the TR (tree) scheme can be eTCR under the compression function is eTCR(r) for some positive integer r. Additionally, we prove that the TH (tree hash) scheme also preserves eTCR.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
