- Sort Score
- Result 10 results
- Languages All
Results 121 - 123 of 123 for nor (0.34 sec)
-
docs/en/docs/release-notes.md
## 0.120.0 There are no major nor breaking changes in this release. ☕️
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Dec 27 19:06:15 UTC 2025 - 586.7K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
bits at a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p) p.Double(p) p.Double(p)...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
bits at a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p) p.Double(p) p.Double(p)...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)