- Sort Score
- Num 10 results
- Language All
Results 41 - 42 of 42 for PN (0.04 seconds)
-
lib/fips140/v1.26.0.zip
p.BitLen() != q.BitLen() { priv.fipsApproved = false } // Check that pq ≡ 1 mod N (and that p < N and q < N). pN := bigmod.NewNat().ExpandFor(N) if _, err := pN.SetBytes(p.Nat().Bytes(p), N); err != nil { return errors.New("crypto/rsa: invalid prime") } qN := bigmod.NewNat().ExpandFor(N) if _, err := qN.SetBytes(q.Nat().Bytes(q), N); err != nil { return errors.New("crypto/rsa: invalid prime") } if pN.Mul(qN, N).IsZero() != 1 { return errors.New("crypto/rsa: p * q != n") } // Check that de ≡ 1 mod p-1, and...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
p.BitLen() != q.BitLen() { priv.fipsApproved = false } // Check that pq ≡ 1 mod N (and that p < N and q < N). pN := bigmod.NewNat().ExpandFor(N) if _, err := pN.SetBytes(p.Nat().Bytes(p), N); err != nil { return errors.New("crypto/rsa: invalid prime") } qN := bigmod.NewNat().ExpandFor(N) if _, err := qN.SetBytes(q.Nat().Bytes(q), N); err != nil { return errors.New("crypto/rsa: invalid prime") } if pN.Mul(qN, N).IsZero() != 1 { return errors.New("crypto/rsa: p * q != n") } // Check that de ≡ 1 mod p-1, and...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)