chore(deps): bump crypto-bigint to 0.7.0-pre.3; use core naming conventions (#516)

See:
 - RustCrypto/crypto-bigint#817

Author: baloo

Cargo.lock

@@ -22,7 +22,7 @@ pkcs8 = { version = "0.11.0-rc.2", default-features = false, features = ["alloc"
 signature = { version = "=3.0.0-pre", default-features = false, features = ["alloc", "digest", "rand_core"] }
 spki = { version = "0.8.0-rc.1", default-features = false, features = ["alloc"] }
 zeroize = { version = "1.5", features = ["alloc"] }
-crypto-bigint = { version = "0.7.0-pre.2", default-features = false, features = ["zeroize", "alloc"] }
+crypto-bigint = { version = "0.7.0-pre.3", default-features = false, features = ["zeroize", "alloc"] }
 crypto-primes = { version = "0.7.0-dev", default-features = false }
 
 # optional dependencies

Cargo.toml

@@ -190,7 +190,7 @@ fn blind<R: TryCryptoRng + ?Sized, K: PublicKeyParts>(
         }
 
         // r^-1 (mod n)
-        ir = r.inv_mod(key.n()).into();
+        ir = r.invert_mod(key.n()).into();
     }
 
     let blinded = {
@@ -348,7 +348,7 @@ pub(crate) fn compute_private_exponent_euler_totient(
 
     // NOTE: `mod_inverse` checks if `exp` evenly divides `totient` and returns `None` if so.
     // This ensures that `exp` is not a factor of any `(prime - 1)`.
-    match exp.inv_mod(&totient).into_option() {
+    match exp.invert_mod(&totient).into_option() {
         Some(res) => Ok(res),
         None => Err(Error::InvalidPrime),
     }
@@ -376,7 +376,7 @@ pub(crate) fn compute_private_exponent_carmicheal(
     let gcd = p1.gcd(&q1);
     let lcm = p1 / NonZero::new(gcd).expect("gcd is non zero") * &q1;
     let exp = exp.resize_unchecked(lcm.bits_precision());
-    if let Some(d) = exp.inv_mod(&lcm).into() {
+    if let Some(d) = exp.invert_mod(&lcm).into() {
         Ok(d)
     } else {
         // `exp` evenly divides `lcm`

src/algorithms/rsa.rs

@@ -497,7 +497,7 @@ impl RsaPrivateKey {
         let p = &self.primes[0];
         let q = &self.primes[1];
 
-        Option::from(q.inv_mod(p))
+        Option::from(q.invert_mod(p))
     }
 
     /// Performs basic sanity checks on the key.