I try calculate time complexity for this algorithm.because I able to compare between them

    private void encrypt()
    {
        M = new BigInteger(64,random);
        C = M.modPow(e,N);//O(n^2 * log e) Rather  O(n^2 * m) where m = log e

    }
    
    private void decrypt()
    {
        Mp = C.modPow(d, N); //O(n^2 * log d) Rather  O(n^2 * k) where k = log d
      
    }
Is two algorithms same time complexity or No.