feat: bump crypto-bigint to 0.7.0-rc.1

Author: dignifiedquire

Cargo.lock

@@ -14,7 +14,7 @@ rust-version = "1.85"
 
 [dependencies]
 const-oid = { version = "0.10", default-features = false }
-crypto-bigint = { version = "0.7.0-rc.0", default-features = false, features = ["zeroize", "alloc"] }
+crypto-bigint = { version = "0.7.0-rc.1", default-features = false, features = ["zeroize", "alloc"] }
 crypto-primes = { version = "0.7.0-pre.1", default-features = false }
 digest = { version = "0.11.0-rc.0", default-features = false, features = ["alloc", "oid"] }
 rand_core = { version = "0.9", default-features = false }

Cargo.toml

@@ -348,6 +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)`.
+    let totient = NonZero::new(totient).expect("known");
     match exp.invert_mod(&totient).into_option() {
         Some(res) => Ok(res),
         None => Err(Error::InvalidPrime),
@@ -376,7 +377,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.invert_mod(&lcm).into() {
+    if let Some(d) = exp.invert_mod(&NonZero::new(lcm).expect("non zero")).into() {
         Ok(d)
     } else {
         // `exp` evenly divides `lcm`

src/algorithms/rsa.rs

@@ -503,8 +503,8 @@ impl RsaPrivateKey {
     pub fn crt_coefficient(&self) -> Option<BoxedUint> {
         let p = &self.primes[0];
         let q = &self.primes[1];
-
-        Option::from(q.invert_mod(p))
+        // TODO: maybe store primes as `NonZero`?
+        Option::from(q.invert_mod(&NonZero::new(p.clone()).expect("prime")))
     }
 
     /// Performs basic sanity checks on the key.