Modular exponentiation is a mathematical operation that calculates the remainder when an integer (base) is raised to a power (exponent) and divided by a positive integer (modulus). It is used in public-key cryptography, and can be computed efficiently even for large integers. It is also believed to be difficult to reverse, making it a candidate for use in cryptographic algorithms.
University of Washington
Autumn 2021
CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.
No concepts data
+ 33 more concepts