Completion requirements
View
Cryptosystems require large numbers for constructing key spaces that are computationally difficult to search by using a brute force attack. As you have seen, the RSA cryptosystem requires the exponentiation of large numbers. Therefore, we must tackle the question of how to perform the exponentiation of large numbers efficiently. Use this material to learn about the repeated squaring algorithm to exponentiate large numbers.
Source: Jeff Suzuki, https://www.youtube.com/watch?v=BLxmwznJ3C8 This work is licensed under a Creative Commons Attribution 3.0 License.