I am trying to deal with RSA.
ed ≡ 1 (mod λ)
Where
λ = LCM (p-1; q-1)
Can not understand how to prove this moment. In the literature, I find information that has just been derived using the extended Euclidean algorithm and is used to further prove the truth m ^ ed ≡ m mod n what ed mod λ ≡ 1
