7/23/2019 Schmorgensborg

http://slidepdf.com/reader/full/schmorgensborg 1/4

Cryptography Assignment 3

Josh Harrington  –  100532897

BUSI3600U

7/23/2019 Schmorgensborg

http://slidepdf.com/reader/full/schmorgensborg 2/4

 

Question 1I have only included 1 screenshot as the information is included in just this one. Imraan, please do not

discriminate against my efficiency.

7/23/2019 Schmorgensborg

http://slidepdf.com/reader/full/schmorgensborg 3/4

Question 2

This code is of course not modular but it satisfies the requirements.

Question 3

I know you had wanted it similar to the process outlined by Miguel, however I have made mine moremodular and it works for any parameter of 2^x. This is much more efficient. Additionally, I do not show

the 16 entries on purpose to show a collision but rather that the central point is that you can get 3

composite numbers to equal that of 3 prime. I have also included my code.

7/23/2019 Schmorgensborg

http://slidepdf.com/reader/full/schmorgensborg 4/4

 

Essentially the code; Takes in random generated values, if it’s prime appends to a prime array if not it

appends it to a composite array. Then arrays of arrays are made to satisfy. Compares matches off the

web interface (in the back end) and prints out when a collision occurs. Imraan I should get full marks for

this, I improved all this stuff. Thanks bahd.