1. Modular exponentiationModular exponentiation is a type of exponentiation performed over a modulus. It is particularly useful in computer science, especially in the field of cryptography. Doing a "modular exponentiation" means calculating the remainder when dividing by a positive integer m (called the modulus) a positive integer b (called the base) raised to the e-th power (e is called the exponent).
Read “Modular exponentiation” on English Wikipedia
Read “冪剰余” on Japanese Wikipedia
Read “Modular exponentiation” on DBpedia
Read “Modular exponentiation” on English Wikipedia
Read “冪剰余” on Japanese Wikipedia
Read “Modular exponentiation” on DBpedia
Discussions
Log in to talk about this word.