Skip to main content

Section 2.7 Conclusion

From the first unit of the course, you should take away an understanding of the structure of the number systems built on modular arithmetic. From a practical standpoint, to build cryptographic systems in the next unit, you will need the following functions:

  1. A gcd function (homegrown preferably).
  2. A extended_euclidean function.
  3. A fastpower function.
  4. A fastinverse function.

Optionally, if you'd like to compare speed of computation, you might also like an inverse function eea_inverse based on the extended Euclidean algorithm.