Lab 3 Fall 2009

This lab is to review parts of Chapter 1 of Das Gupta et al's text book. Please go to your lab, do the problems to get your full credit for the lab.
You will use Big Integer Package for this project.
  1. Please get familar with a BigInteger Package in C++. For example bigint package and you can down load bigint-2009.05.03.zip unzip - compile and get familar with that package (you are welcome to choose any bigint package).
  2. Use that package and write functions to test primality of large numbers. For example, test whether a) 32589158477190044803 b) 32589158477190044911 c) 58021664585639791181184025950440248398226136069516938232493687505822471836536824298822733710342250697739996825938232641940670857624514103125986134050997697160127301547995788468137887651823707102007839 and d) 58021664585639791181184025950440248398226136069516938232493687505822471836536824298822733710342250697739996825938232641940670857624514103125986134050997697160127301547995788468137887651823707102007 are prime (We have to use modexp function)
  3. Implement the encoding part of RSA scheme using the bigint package.(pick p and q to be at leats 40 digits long). ( We have to use modexp function)
  4. (optional) Implement the decoding part of the RSA scheme. (You have to use extended euclidean algorithm to get multiplicative inverse)