Course contentsShow
Mathematics
Lesson 2763 of 3,12154. Number TheoryPro lesson

Computing φ(n) for RSA

Calculate Euler's totient φ(n) = (p-1)(q-1) and understand its role in the RSA algorithm.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.