Information Security

I don’t care about the coding write by yourself or copy the internet(need the source). answer those 4 questions and take the screenshot for the test run of your program when solving Q3&Q4

1. Write a program (in any language you like) that allows the user to first record some iris data (iris code with the corresponding person’s name), and then try to authenticate people. That is, the user can enter some iris data with unknown people, and your program should be able to calculate and display the Hamming distance between each unknown & known iris data. Finally, based on the resulting Hamming distances, your program should be able to decide whether these are any matches or not (based on the accepted-match requirement stated on L10 P13).

2. For simplicity, suppose a particular iris scan system generates 16-bit iris codes instead of the standard 2048-bit iris codes.

During the [ Select ] [“enrollment“, “recognition“] phase, the system record the following iris codes from Alice & Bob (in hex).

• Alice: 9CF8CD32
• Bob: E99D7B76

And during the [ Select ] [“recognition“, “enrollment“] phase, the system got the following iris code from the people who try to get access. (in hex).

X: FDBC6954

Y: D2DE6B62

Z: 8CD9F911

3. Use your program from Q10.1 and the data from Q10.2. Get the hamming distance for the following (enter 2 decimal places)

d(Alice, X) =

d(Alice, Y) =

d(Alice, Z) =

d(Bob, X) =

d(Bob, Y) =

d(Bob, Z) =

4. Use your program from Q10.1 and the result from Q10.3.

Iris X can be authenticated as [ Select ] [“Bob“, “(n/a – can’t tell)“, “(n/a – neither of them)“, “Alice“] ;

Iris Y can be authenticated as [ Select ] [“Alice“, “Bob“, “(n/a – can’t tell)“, “(n/a – neither of them)“] ;

Iris Z can be authenticated as [ Select ] [“(n/a – can’t tell)“, “(n/a – neither of them)“, “Bob“, “Alice“] ;

5. Insert a screenshot of the test run of your program when solving 3 & 4.