Assignment Task: Explore how Public Key Cryptography works.
Using your Student ID, generate two primes and encrypt your student ID with your own Private Key.
Use the Wiener attack to break your private key and is this way steal your identity by using your private key to encode another number and masquerade as you.
Making your own Keys:
(1) Explore how Public Key Cryptography works and summarize this in your own words with particular attention to how the method generates these keys.
(2) From your exploration above, generate Private and Public Keys using your student ID.
(3) Using your student ID, determine how bits the number part can be represented with.
(4) For a particular number of binary bits determine the number of prime numbers available in that bit range.
(5)
(i) Using the Wolframalpha "nextprime" function and your student ID create two prime numbers which are of the form 4x+1. Such that P1 =4x1+1 and P2=4x2+1.
(ii) Check that they have the same number of binary bits.
(6)
(i) Using the Wolframalpha "nextprime" function and your student ID create two prime numbers which are of the form 4x+3. Such that P3 =4x3+3 and P4=4x4+3.
(ii) Check that they have the same number of binary bits.
(7)
(i) Use P1 and P2 to generate your public keys and encrypt your student ID.
(ii) Use P3 and P4 to generate your public keys and encrypt your student ID.
(8) Create a private key and use this to decrypt and recover your student ID.
Breaking the Keys:
I) Express P1 and P2 as the sum of two squares (for example 5=12 +22).
Draw these as two right angle triangles (a,b,c). Note that c1 = √(P1 ) , c2 = √(P2)
(a) Using the equations below:
Let P1 = C1 and P2 = C2 and let the smallest value of the two squares be nexpress the sides of each triangle as:
c = n2 + (n+2m-1)2 b = 2n(n+2m-1) a=(2m-1)(2m+2n-1)
(b) Test that both your triangle solutions meet the condition that: c2 = a2 + b2. Represent this geometrically.
(c) Multiply P1 and P2 together: N=P1P2. Can N be expressed as the sum of two squares? Does this correspond to part 2(iii)(a).
(d) Using Euler's factorization method, show how the original prime numbers can be recovered using the sum of squares method.
Can P3 and P4 be represented as the sum of two squares?
Can N:N= P3 P4 be expressed as the sum of two squares as in (iii)(c)? Can Euler's Factorization now be used? Why?
For Primes, P1 and P2 , subtract 1 and multiply these together: φ(n)=(P1-1)(P2-1)
Show that if φ(n) and N are known, that the original primes P1and P2 can be recovered.
Using your public key, show how your private keys can be recovered using the Wiener attack by recovering P1 and P2.
As the villain, armed with this information and masquerading as you, send a different encrypted Student ID (not yours) encrypted with the recovered key. Use the same public key as earlier to recover the masquerading Student ID.
Final Report:
Your final report is a professional representation of parts (1) and (2) above, drawing on the relevant literature (including journals) where relevant and properly referencing these. You should also look at linkages between parts (1) and (2) and explore the structures of primes with particular attention to why primes of the type 4x+1 are weaker than 4x+3.
We, as Public Key Cryptography Assignment Help service always provide the well-researched and step-wise assignment solutions to the students, so that, students can without trouble secure top-notch grades, as well as gain thorough knowledge.
Tags: Public Key Cryptography Assignment Help, Public Key Cryptography Homework Help, Public Key Cryptography Coursework, Public Key Cryptography Solved Assignments, Private and Public Keys Assignment Help, Private and Public Keys Homework Help