Search results
Results From The WOW.Com Content Network
In this case, finding f from n and e is as difficult as computing φ(n) (this has not been proven, but no algorithm is known for computing f without knowing φ(n)). Knowing only n , the computation of φ ( n ) has essentially the same difficulty as the factorization of n , since φ ( n ) = ( p − 1)( q − 1) , and conversely, the factors p ...