List of questions
Related questions
Question 39 - 212-81 discussion
When learning algorithms, such as RSA, it is important to understand the mathematics being used. In RSA, the number of positive integers less than or equal to some number is critical in key generation. The number of positive integers less than or equal to n that are coprime to n is called ______.
A.
Mersenne's number
B.
Fermat's number
C.
Euler's totient
D.
Fermat's prime
Your answer:
0 comments
Sorted by
Leave a comment first