}
  private static final BigInteger RSAEP(final RSAPublicKey K, final BigInteger m)  {    // 1. If the representative m is not between 0 and n - 1, output    //    "representative out of range" and stop.    final BigInteger n = K.getModulus();    if (m.compareTo(ZERO) < 0 || m.compareTo(n.subtract(ONE)) > 0)      {        throw new IllegalArgumentException();      }    // 2. Let c = m^e mod n.    final BigInteger e = K.getPublicExponent();    final BigInteger result = m.modPow(e, n);    // 3. Output c.    return result;  }