- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 139 for nprimes (0.13 sec)
-
src/crypto/rsa/rsa.go
priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne) priv.Precomputed.Dq.Mod(priv.D, priv.Precomputed.Dq) priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0]) r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1]) priv.Precomputed.CRTValues = make([]CRTValue, len(priv.Primes)-2) for i := 2; i < len(priv.Primes); i++ { prime := priv.Primes[i] values := &priv.Precomputed.CRTValues[i-2]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 23.4K bytes - Viewed (0) -
src/math/big/prime.go
var rA, rB uint32 switch _W { case 32: rA = uint32(x.abs.modW(primesA)) rB = uint32(x.abs.modW(primesB)) case 64: r := x.abs.modW((primesA * primesB) & _M) rA = uint32(r % primesA) rB = uint32(r % primesB) default: panic("math/big: invalid word size") } if rA%3 == 0 || rA%5 == 0 || rA%7 == 0 || rA%11 == 0 || rA%13 == 0 || rA%17 == 0 || rA%19 == 0 || rA%23 == 0 || rA%37 == 0 ||
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 10.4K bytes - Viewed (0) -
test/chan/sieve1.go
// Note that ch is different on each iteration. prime := <-ch primes <- prime ch1 := make(chan int) go Filter(ch, ch1, prime) ch = ch1 } } func main() { primes := make(chan int) go Sieve(primes) a := []int{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97} for i := 0; i < len(a); i++ { if x := <-primes; x != a[i] { println(x, " != ", a[i])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 1.5K bytes - Viewed (0) -
test/chan/sieve2.go
go func() { // In order to generate the nth prime we only need multiples of // primes ≤ sqrt(nth prime). Thus, the merging goroutine will // receive from 'primes' much slower than this goroutine // will send to it, making the buffer accumulate and block this // goroutine from sending, causing a deadlock. The solution is to // use a proxy goroutine to do automatic buffering. primes := sendproxy(primes) candidates := odds()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 3.9K bytes - Viewed (0) -
src/crypto/rsa/boring.go
} func copyPrivateKey(k *PrivateKey) PrivateKey { dst := PrivateKey{ PublicKey: copyPublicKey(&k.PublicKey), D: new(big.Int).Set(k.D), } dst.Primes = make([]*big.Int, len(k.Primes)) for i, p := range k.Primes { dst.Primes[i] = new(big.Int).Set(p) } if x := k.Precomputed.Dp; x != nil { dst.Precomputed.Dp = new(big.Int).Set(x) } if x := k.Precomputed.Dq; x != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 18 00:30:19 UTC 2022 - 3.3K bytes - Viewed (0) -
src/crypto/x509/pkcs1.go
E: priv.E, N: priv.N, } key.D = priv.D key.Primes = make([]*big.Int, 2+len(priv.AdditionalPrimes)) key.Primes[0] = priv.P key.Primes[1] = priv.Q for i, a := range priv.AdditionalPrimes { if a.Prime.Sign() <= 0 { return nil, errors.New("x509: private key contains zero or negative prime") } key.Primes[i+2] = a.Prime // We ignore the other two values because rsa will calculate // them as needed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:09:47 UTC 2023 - 4.7K bytes - Viewed (0) -
src/math/big/prime_test.go
} func TestProbablyPrime(t *testing.T) { nreps := 20 if testing.Short() { nreps = 1 } for i, s := range primes { p, _ := new(Int).SetString(s, 10) if !p.ProbablyPrime(nreps) || nreps != 1 && !p.ProbablyPrime(1) || !p.ProbablyPrime(0) { t.Errorf("#%d prime found to be non-prime (%s)", i, s) } } for i, s := range composites { s = strings.Map(cutSpace, s) c, _ := new(Int).SetString(s, 10)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 12:54:00 UTC 2019 - 7.1K bytes - Viewed (0) -
src/internal/trace/testdata/tests/go122-annotations.test
pc=4815228 func=38 file=31 line=27 Stack id=12 nframes=1 pc=4815680 func=34 file=31 line=37 Stack id=6 nframes=1 pc=4544768 func=43 file=42 line=868 Stack id=2 nframes=3 pc=4538523 func=45 file=42 line=238 pc=4814277 func=37 file=36 line=125 pc=4815228 func=38 file=31 line=27 Stack id=13 nframes=1 pc=4815492 func=38 file=31 line=37 Stack id=4 nframes=1 pc=4547456 func=56 file=50 line=42
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 8.7K bytes - Viewed (0) -
src/runtime/proc_runtime_test.go
package runtime func RunStealOrderTest() { var ord randomOrder for procs := 1; procs <= 64; procs++ { ord.reset(uint32(procs)) if procs >= 3 && len(ord.coprimes) < 2 { panic("too few coprimes") } for co := 0; co < len(ord.coprimes); co++ { enum := ord.start(uint32(co)) checked := make([]bool, procs) for p := 0; p < procs; p++ { x := enum.position() if checked[x] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 18:43:08 UTC 2022 - 1.4K bytes - Viewed (0) -
src/internal/trace/testdata/tests/go122-annotations-stress.test
Stack id=65 nframes=2 pc=4803943 func=112 file=113 line=64 pc=4803629 func=114 file=113 line=47 Stack id=28 nframes=1 pc=4804691 func=124 file=113 line=70 Stack id=48 nframes=2 pc=4803943 func=112 file=113 line=64 pc=4803589 func=114 file=113 line=45 Stack id=61 nframes=3 pc=4599892 func=130 file=131 line=195 pc=4804036 func=112 file=113 line=83 pc=4803609 func=114 file=113 line=46 Stack id=13 nframes=2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 38.3K bytes - Viewed (0)