Exit 212-81 EC-Council Certified Encryption Specialist (ECES)
Question 1 of 5
0% complete
Q1 Single choice

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

Previous Next