This module not only explores the Euclidean algorithm, but dives into cryptography and modular arithmetic.

This video introduces the Euclidean algorithm.

This video demonstrates how the Euclidean algorithm can be used to find the greatest common denominator of two large numbers.

This video explores the fundamental concepts of cryptography, including encryption, decryption, plaintext, ciphertext, and keys.

This video shows how modular arithmetic is used in RSA code to solve a problem.

Click here to schedule a 1:1 with a tutor, coach, and or sign up for a workshop. *If this link does not bring you directly to our platform, please use our direct link to "Academic Support" from any Brightspace course at the top of the navigation bar.