Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Suppose h 1 : {0,1} 2m {0,1} m is a collision resistant hash function. (1) Define h 2 : {0,1} 4m {0,1} m as follows:

Suppose h1: {0,1}2m {0,1}m is a collision resistant hash function.

(1) Define h2: {0,1}4m {0,1}m as follows:

a. Write x{0,1}4m as x=x1||x2, where x1, x2 {0,1}2m.

b. Define h2(x)=h1(h1(x1)||h1(x2)).

Prove that h2 is collision resistant.

(2) For an integer i 2, define a hash function hi: {0,1}image text in transcribedimage text in transcribed(2^i)m {0,1}m recursively from hi-1, as follows:

a. Write x {0,1}image text in transcribedimage text in transcribed(2^i)m as x=x1||x2, where x1, x2 {0,1}image text in transcribedimage text in transcribed(2^i)m

b. Define hi(x)=h1(hi-1(x1)||hi-1(x2)).

Prove that hi is collision resistant.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_step_2

Step: 3

blur-text-image_step3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

DB2 Universal Database V7.1 Application Development Certification Guide

Authors: Steve Sanyal, David Martineau, Kevin Gashyna, Michael Kyprianou

1st Edition

ISBN: 0130913677, 978-0130913678

More Books

Students also viewed these Databases questions