- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for zsqr (0.11 sec)
-
src/crypto/internal/nistec/p256_asm_arm64.s
#define y2in(off) (32*0 + 8 + off)(RSP) #define s2(off) (32*1 + 8 + off)(RSP) #define z1sqr(off) (32*2 + 8 + off)(RSP) #define h(off) (32*3 + 8 + off)(RSP) #define r(off) (32*4 + 8 + off)(RSP) #define hsqr(off) (32*5 + 8 + off)(RSP) #define rsqr(off) (32*6 + 8 + off)(RSP) #define hcub(off) (32*7 + 8 + off)(RSP) #define z2sqr(off) (32*8 + 8 + off)(RSP) #define s1(off) (32*9 + 8 + off)(RSP)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 29.7K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_asm_amd64.s
#undef s2 #undef u1 #undef u2 #undef z1sqr #undef z2sqr #undef h #undef r #undef hsqr #undef rsqr #undef hcub #undef rptr /* ---------------------------------------*/ #define x(off) (32*0 + off)(SP) #define y(off) (32*1 + off)(SP) #define z(off) (32*2 + off)(SP) #define s(off) (32*3 + off)(SP) #define m(off) (32*4 + off)(SP) #define zsqr(off) (32*5 + off)(SP)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 39.8K bytes - Viewed (0) -
src/encoding/xml/read_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 29.1K bytes - Viewed (0) -
src/math/big/prime.go
// V(k'+1) = V(2k+2) = V(k+1)² - 2. t1 = t1.sqr(vk1) t1 = t1.add(t1, nm2) t2, vk1 = t2.div(vk1, t1, n) } else { // k' = 2k // V(k'+1) = V(2k+1) = V(k) V(k+1) - P. t1 = t1.mul(vk, vk1) t1 = t1.add(t1, n) t1 = t1.sub(t1, natP) t2, vk1 = t2.div(vk1, t1, n) // V(k') = V(2k) = V(k)² - 2 t1 = t1.sqr(vk) t1 = t1.add(t1, nm2) t2, vk = t2.div(vk, t1, n) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 10.4K bytes - Viewed (0) -
src/math/big/nat.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe_test.go
x2sq.Square(&x) if x2 != x2sq { t.Fatalf("all ones failed\nmul: %x\nsqr: %x\n", x2, x2sq) } var bytes [32]byte _, err := io.ReadFull(rand.Reader, bytes[:]) if err != nil { t.Fatal(err) } x.SetBytes(bytes[:]) x2.Multiply(&x, &x) x2sq.Square(&x) if x2 != x2sq { t.Fatalf("all ones failed\nmul: %x\nsqr: %x\n", x2, x2sq) } } func TestEqual(t *testing.T) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 17:26:17 UTC 2023 - 13.9K bytes - Viewed (0) -
src/math/big/nat_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 09 15:29:36 UTC 2024 - 26.2K bytes - Viewed (0) -
src/math/big/rat.go
func (z *Rat) Mul(x, y *Rat) *Rat { if x == y { // a squared Rat is positive and can't be reduced (no need to call norm()) z.a.neg = false z.a.abs = z.a.abs.sqr(x.a.abs) if len(x.b.abs) == 0 { z.b.abs = z.b.abs.setWord(1) } else { z.b.abs = z.b.abs.sqr(x.b.abs) } return z } z.a.Mul(&x.a, &y.a) z.b.abs = mulDenom(z.b.abs, x.b.abs, y.b.abs) return z.norm() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
src/math/big/ratconv.go
var t, r nat // temporaries for { if _, r = t.div(r, q, f); len(r) != 0 { break // f doesn't divide q evenly } tab = append(tab, f) f = nat(nil).sqr(f) // nat(nil) to ensure a new f for each table entry } // Factor q using the table entries, if any. // We start with the largest factor f = tab[len(tab)-1] // that evenly divides q. It does so at most once because
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 12.3K bytes - Viewed (0) -
src/math/big/natconv.go
for i := 0; i < k; i++ { if table[i].ndigits == 0 { if i == 0 { table[0].bbb = nat(nil).expWW(bb, Word(leafSize)) table[0].ndigits = ndigits * leafSize } else { table[i].bbb = nat(nil).sqr(table[i-1].bbb) table[i].ndigits = 2 * table[i-1].ndigits } // optimization: exploit aggregated extra bits in macro blocks larger = nat(nil).set(table[i].bbb)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 14.6K bytes - Viewed (0)