- Sort Score
- Result 10 results
- Languages All
Results 31 - 39 of 39 for Multiplication (0.18 sec)
-
src/crypto/internal/nistec/fiat/p256_invert.go
// // If x == 0, Invert returns e = 0. func (e *P256Element) Invert(x *P256Element) *P256Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 12 multiplications and 255 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:03 UTC 2022 - 1.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Hashing.java
* @author Austin Appleby */ @GwtCompatible @ElementTypesAreNonnullByDefault final class Hashing { private Hashing() {} /* * These should be ints, but we need to use longs to force GWT to do the multiplications with * enough precision. */ private static final long C1 = 0xcc9e2d51; private static final long C2 = 0x1b873593; /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Aug 05 00:40:25 UTC 2021 - 2.5K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p521_invert.go
// // If x == 0, Invert returns e = 0. func (e *P521Element) Invert(x *P521Element) *P521Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 13 multiplications and 520 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _1100 = _11 << 2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 1.8K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p224_invert.go
// // If x == 0, Invert returns e = 0. func (e *P224Element) Invert(x *P224Element) *P224Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 11 multiplications and 223 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 1.8K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p384_invert.go
// // If x == 0, Invert returns e = 0. func (e *P384Element) Invert(x *P384Element) *P384Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of 15 multiplications and 383 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 2.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Hashing.java
* @author Austin Appleby */ @GwtCompatible @ElementTypesAreNonnullByDefault final class Hashing { private Hashing() {} /* * These should be ints, but we need to use longs to force GWT to do the multiplications with * enough precision. */ private static final long C1 = 0xcc9e2d51; private static final long C2 = 0x1b873593; /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Aug 05 00:40:25 UTC 2021 - 2.5K bytes - Viewed (0) -
test/torture.go
} // A right-leaning tree of byte multiplications. func righttree(a, b, c, d uint8) uint8 { return a * (b * (c * (d * (a * (b * (c * (d * (a * (b * (c * (d * (a * (b * (c * (d * (a * (b * (c * (d * a * (b * (c * d))))))))))))))))))))) } // A left-leaning tree of byte multiplications. func lefttree(a, b, c, d uint8) uint8 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jul 01 07:20:51 UTC 2014 - 7.7K bytes - Viewed (0) -
src/crypto/internal/nistec/p224_sqrt.go
} else { p224GG[i].Square(&p224GG[i-1]) } } }) // r <- x^((q+1)/2) = x^(2^127) // v <- x^q = x^(2^128-1) // Compute x^(2^127-1) first. // // The sequence of 10 multiplications and 126 squarings is derived from the // following addition chain generated with github.com/mmcloughlin/addchain v0.4.0. // // _10 = 2*1 // _11 = 1 + _10 // _110 = 2*_11 // _111 = 1 + _110
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 3.1K bytes - Viewed (1) -
src/crypto/internal/nistec/fiat/generate.go
// // If x == 0, Invert returns e = 0. func (e *Element) Invert(x *Element) *Element { // Inversion is implemented as exponentiation with exponent p − 2. // The sequence of {{ .Ops.Adds }} multiplications and {{ .Ops.Doubles }} squarings is derived from the // following addition chain generated with {{ .Meta.Module }} {{ .Meta.ReleaseTag }}. // {{- range lines (format .Script) }} // {{ . }} {{- end }} //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 9.1K bytes - Viewed (0)