Skip to main content
Logo image

Exercises 11.8 Exercises


Do all the encryptions and/or encodings in Sections 11.1 and 11.2 ‘by hand’.


Encrypt your name using an affine method (\(ax+b\)) with key \((5,6,29)\) (don’t worry about letters), and decrypt BXHBI.


Create your own \(ax+b\) (mod \(n\)) system of encryption and bring an encrypted message to class (or a friend also interested in number theory).


Use the Diffie-Hellman method of encryption to encrypt a short (three to five character) message with a \(26<p<50\) ‘by hand’ (i.e. without Sage but with a calculator). Be prepared to explain your choice of \(e\) and \(p\text{,}\) and calculate that \(ef\equiv 1\) (mod \(p-1\)) by hand.


Draw a diagram and show that if Eve has control of both communications in Diffie-Hellman key exchange (Algorithm 11.4.2), she can intercept and decrypt all messages.


Do this two-parter using Diffie-Hellman modular exponentiation:
  • Suppose you discovered that the message 4363094, where \(p=7387543\text{,}\) actually represented the (numerical) message 2718. What steps might you take to try to discover \(e\text{?}\)
  • Suppose that you discovered in the previous part by hard work that \(e=35\text{.}\) Now quickly decrypt the message 6618138.


Pick two primes between 1000 and 2000 and create an RSA public key \((n,e)\) for them. What is the decryption key \(f\text{?}\) Show your work.


Suppose that \(n=9211\) and \(e=539\text{.}\)
  • Encrypt a (short) message.
  • Find the decryption key \(f\) for this situation, and decrypt your message.
  • Use \(f\) to sign your name!


Come up with your own RSA public-key system by choosing \(p\) and \(q\) and \(e\) as appropriate, but with \(n>10000\text{;}\) then encrypt a short numerical message and hand in only the public key \((n,e)\) and the encrypted message. (Your instructor’s job will be to crack it!)


Learn about a symmetric key cryptosystem in common use. Do you own any devices which use it?


Learn about the El-Gamal public key encryption method. How is it implemented? What mathematics used there is similar to what is used in this chapter? What is different?


Learn about the Advanced Encryption Standard. How is the mathematics used there different from what is used in this chapter?


Examine the code for encode and decode throughout, or have your instructor explain it. If you were trying to encode real human communication, what improvements would you like to make to these? Could you implement them, and how?


In Example 11.7.2, explain mathematically the necessity of the Sage comment # First line: turn modular integers back into integers just before the invocation of the Chinese Remainder Theorem with CRT.