chore(deps): bump rand_core to 0.10.0-rc-5 (#108)

* chore(deps): bump `rand_core` to `0.10.0-rc-5`

* chore(deps): bump `crypto-bigint` to `0.7.0-pre.21`

Author: baloo

Cargo.toml

@@ -10,9 +10,9 @@ categories = ["cryptography", "no-std"]
 rust-version = "1.85"
 
 [dependencies]
-crypto-bigint = { version = "0.7.0-rc.16", default-features = false, features = ["rand_core"] }
+crypto-bigint = { version = "0.7.0-rc.21", default-features = false, features = ["rand_core"] }
 libm = { version = "0.2.13", default-features = false, features = ["arch"] }
-rand_core = { version = "0.10.0-rc-3", default-features = false }
+rand_core = { version = "0.10.0-rc-5", default-features = false }
 rayon = { version = "1", optional = true, default-features = false }
 
 # Optional dependencies used in tests and benchmarks
@@ -23,7 +23,7 @@ glass_pumpkin = { version = "1", optional = true }
 [dev-dependencies]
 rand = { version = "0.10.0-rc.6", features = ["chacha"] }
 # need `crypto-bigint` with `alloc` to test `BoxedUint`
-crypto-bigint = { version = "0.7.0-pre.16", default-features = false, features = ["alloc"] }
+crypto-bigint = { version = "0.7.0-pre.21", default-features = false, features = ["alloc"] }
 criterion = { version = "0.5", features = ["html_reports"] }
 num-modular = { version = "0.5", features = ["num-bigint"] }
 num-bigint = "0.4"
@@ -61,3 +61,6 @@ harness = false
 [[bench]]
 name = "cctv"
 harness = false
+
+[patch.crates-io]
+rand = { git = "https://github.com/rust-random/rand.git" }

src/fips.rs

@@ -140,7 +140,7 @@ where
     // Safe primes are always of the form 4k + 3 (i.e. n ≡ 3 mod 4)
     // The last two digits of a binary number give you its value modulo 4.
     // Primes p=4n+3 will always end in 11 in binary because p ≡ 3 mod 4.
-    if candidate.as_ref()[0].0 & 3 != 3 {
+    if candidate.as_limbs()[0].0 & 3 != 3 {
         return false;
     }
 

src/hazmat/gcd.rs

@@ -23,7 +23,7 @@ where
     } else {
         // In this branch `n` is `Word::BITS` bits or shorter,
         // so we can safely take the first limb.
-        let n = n.as_ref()[0].0;
+        let n = n.as_limbs()[0].0;
         if n > m { (n, m) } else { (m, n) }
     };
 

src/hazmat/jacobi.rs

@@ -24,7 +24,7 @@ fn reduce_numerator_long<T>(j: JacobiSymbol, a: Word, p: &T) -> (JacobiSymbol, W
 where
     T: Unsigned,
 {
-    apply_reduce_numerator(j, a, p.as_ref()[0].0)
+    apply_reduce_numerator(j, a, p.as_limbs()[0].0)
 }
 
 fn reduce_numerator_short(j: JacobiSymbol, a: Word, p: Word) -> (JacobiSymbol, Word) {
@@ -39,7 +39,7 @@ fn apply_swap(j: JacobiSymbol, a: Word, p: Word) -> JacobiSymbol {
 }
 
 fn swap_long<T: Unsigned>(j: JacobiSymbol, a: Word, p: &Odd<T>) -> (JacobiSymbol, &Odd<T>, Word) {
-    let j = apply_swap(j, a, p.as_ref().as_ref()[0].0);
+    let j = apply_swap(j, a, p.as_ref().as_limbs()[0].0);
     (j, p, a)
 }
 
@@ -59,7 +59,7 @@ where
     // (-a/n) = (-1/n) * (a/n)
     //        = (-1)^((n-1)/2) * (a/n)
     //        = (-1 if n = 3 mod 4 else 1) * (a/n)
-    let result = if a_is_negative && p_long.as_ref().as_ref()[0].0 & 3 == 3 {
+    let result = if a_is_negative && p_long.as_ref().as_limbs()[0].0 & 3 == 3 {
         -result
     } else {
         result
@@ -75,7 +75,7 @@ where
     // Normalize input: at the end we want `a < p`, `p` odd, and both fitting into a `Word`.
     let (result, a, p): (JacobiSymbol, Word, Word) = if p_long.bits_vartime() <= Limb::BITS {
         let a = a_limb.0;
-        let p = p_long.as_ref().as_ref()[0].0;
+        let p = p_long.as_ref().as_limbs()[0].0;
         (result, a % p, p)
     } else {
         let (result, a) = reduce_numerator_long(result, a_limb.0, p_long.as_ref());

src/hazmat/lucas.rs

@@ -49,7 +49,7 @@ impl LucasBase for SelfridgeBase {
         let mut abs_d = 5;
         let mut d_is_negative = false;
         let n_is_small = n.bits_vartime() < Word::BITS; // if true, `n` fits into one `Word`
-        let small_n = n.as_ref().as_ref()[0].0;
+        let small_n = n.as_ref().as_limbs()[0].0;
         let mut attempts = 0;
         loop {
             if attempts >= MAX_ATTEMPTS {

src/hazmat/sieve.rs

@@ -84,7 +84,7 @@ pub(crate) fn equals_primitive<T>(num: &T, primitive: Word) -> bool
 where
     T: Unsigned,
 {
-    num.bits_vartime() <= Word::BITS && num.as_ref()[0].0 == primitive
+    num.bits_vartime() <= Word::BITS && num.as_limbs()[0].0 == primitive
 }
 
 // The type we use to calculate incremental residues.
@@ -202,10 +202,7 @@ where
         }
 
         // Find the increment limit.
-        let max_value = match T::one_like(&self.base)
-            .overflowing_shl_vartime(self.max_bit_length)
-            .into()
-        {
+        let max_value = match T::one_like(&self.base).overflowing_shl_vartime(self.max_bit_length) {
             Some(val) => val,
             None => T::one_like(&self.base),
         };
@@ -218,7 +215,7 @@ where
             self.last_round = true;
             // Can unwrap here since we just checked above that `incr_limit <= INCR_LIMIT`,
             // and `INCR_LIMIT` fits into `Residue`.
-            let incr_limit_small: Residue = incr_limit.as_ref()[0]
+            let incr_limit_small: Residue = incr_limit.as_limbs()[0]
                 .0
                 .try_into()
                 .expect("the increment limit should fit within `Residue`");
@@ -427,7 +424,7 @@ where
     };
     let start_limit: SmallPrime = if start_bits <= max_prime_bits {
         // Can convert since we just checked the bit size
-        start.as_ref()[0].0.try_into().expect("The number is in range")
+        start.as_limbs()[0].0.try_into().expect("The number is in range")
     } else {
         SmallPrime::MAX
     };

src/presets.rs

@@ -106,7 +106,7 @@ where
     // Safe primes are always of the form 4k + 3 (i.e. n ≡ 3 mod 4)
     // The last two digits of a binary number give you its value modulo 4.
     // Primes p=4n+3 will always end in 11 in binary because p ≡ 3 mod 4.
-    if candidate.as_ref()[0].0 & 3 != 3 {
+    if candidate.as_limbs()[0].0 & 3 != 3 {
         return false;
     }