Home
last modified time | relevance | path

Searched refs:exponents (Results 1 – 25 of 77) sorted by relevance

1234

/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/field/
DGF2Polynomial.java7 protected final int[] exponents; field in GF2Polynomial
9 GF2Polynomial(int[] exponents) in GF2Polynomial() argument
11 this.exponents = Arrays.clone(exponents); in GF2Polynomial()
16 return exponents[exponents.length - 1]; in getDegree()
21 return Arrays.clone(exponents); in getExponentsPresent()
35 return Arrays.areEqual(exponents, other.exponents); in equals()
40 return Arrays.hashCode(exponents); in hashCode()
DFiniteFields.java10 public static PolynomialExtensionField getBinaryExtensionField(int[] exponents) in getBinaryExtensionField() argument
12 if (exponents[0] != 0) in getBinaryExtensionField()
16 for (int i = 1; i < exponents.length; ++i) in getBinaryExtensionField()
18 if (exponents[i] <= exponents[i - 1]) in getBinaryExtensionField()
24 return new GenericPolynomialExtensionField(GF_2, new GF2Polynomial(exponents)); in getBinaryExtensionField()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/field/
DGF2Polynomial.java8 protected final int[] exponents; field in GF2Polynomial
10 GF2Polynomial(int[] exponents) in GF2Polynomial() argument
12 this.exponents = Arrays.clone(exponents); in GF2Polynomial()
17 return exponents[exponents.length - 1]; in getDegree()
22 return Arrays.clone(exponents); in getExponentsPresent()
36 return Arrays.areEqual(exponents, other.exponents); in equals()
41 return Arrays.hashCode(exponents); in hashCode()
DFiniteFields.java14 public static PolynomialExtensionField getBinaryExtensionField(int[] exponents) in getBinaryExtensionField() argument
16 if (exponents[0] != 0) in getBinaryExtensionField()
20 for (int i = 1; i < exponents.length; ++i) in getBinaryExtensionField()
22 if (exponents[i] <= exponents[i - 1]) in getBinaryExtensionField()
28 return new GenericPolynomialExtensionField(GF_2, new GF2Polynomial(exponents)); in getBinaryExtensionField()
/external/epid-sdk/epid/verifier/1.1/src/
Dverifybasic.c277 BigNum const* exponents[3]; in Epid11VerifyBasicSig() local
281 exponents[0] = sa_bn; in Epid11VerifyBasicSig()
282 exponents[1] = sb_bn; in Epid11VerifyBasicSig()
283 exponents[2] = nc_bn; in Epid11VerifyBasicSig()
284 res = EcMultiExpBn(G1, points, exponents, COUNT_OF(points), R1); in Epid11VerifyBasicSig()
293 BigNum const* exponents[3]; in Epid11VerifyBasicSig() local
297 exponents[0] = salpha_bn; in Epid11VerifyBasicSig()
298 exponents[1] = sbeta_bn; in Epid11VerifyBasicSig()
299 exponents[2] = nsx_bn; in Epid11VerifyBasicSig()
300 res = EcMultiExpBn(G1, points, exponents, COUNT_OF(points), R2); in Epid11VerifyBasicSig()
[all …]
Dnrverify.c180 BigNum const* exponents[2]; in Epid11NrVerify() local
183 exponents[0] = smu; in Epid11NrVerify()
184 exponents[1] = snu; in Epid11NrVerify()
185 res = EcMultiExpBn(G3, points, exponents, COUNT_OF(points), R1); in Epid11NrVerify()
201 BigNum const* exponents[3]; in Epid11NrVerify() local
205 exponents[0] = smu; in Epid11NrVerify()
206 exponents[1] = snu; in Epid11NrVerify()
207 exponents[2] = nc_tick_bn; in Epid11NrVerify()
208 res = EcMultiExpBn(G3, points, exponents, COUNT_OF(points), R2); in Epid11NrVerify()
/external/epid-sdk/epid/verifier/src/
Dverifybasic.c226 BigNumStr const* exponents[2]; in EpidVerifyBasicSig() local
229 exponents[0] = &sf_str; in EpidVerifyBasicSig()
230 exponents[1] = &nc_str; in EpidVerifyBasicSig()
231 res = EcMultiExp(G1, points, exponents, COUNT_OF(points), R1); in EpidVerifyBasicSig()
239 BigNumStr const* exponents[2]; in EpidVerifyBasicSig() local
242 exponents[0] = &nsx_str; in EpidVerifyBasicSig()
243 exponents[1] = &nc_str; in EpidVerifyBasicSig()
244 res = EcMultiExp(G2, points, exponents, COUNT_OF(points), t1); in EpidVerifyBasicSig()
258 BigNumStr const* exponents[4]; in EpidVerifyBasicSig() local
263 exponents[0] = &sf_str; in EpidVerifyBasicSig()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/
DX9ECParameters.java141 int[] exponents = field.getMinimalPolynomial().getExponentsPresent(); in X9ECParameters() local
142 if (exponents.length == 3) in X9ECParameters()
144 this.fieldID = new X9FieldID(exponents[2], exponents[1]); in X9ECParameters()
146 else if (exponents.length == 5) in X9ECParameters()
148 … this.fieldID = new X9FieldID(exponents[4], exponents[1], exponents[2], exponents[3]); in X9ECParameters()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/asn1/x9/
DX9ECParameters.java143 int[] exponents = field.getMinimalPolynomial().getExponentsPresent(); in X9ECParameters() local
144 if (exponents.length == 3) in X9ECParameters()
146 this.fieldID = new X9FieldID(exponents[2], exponents[1]); in X9ECParameters()
148 else if (exponents.length == 5) in X9ECParameters()
150 … this.fieldID = new X9FieldID(exponents[4], exponents[1], exponents[2], exponents[3]); in X9ECParameters()
/external/tensorflow/tensorflow/compiler/xla/tests/
Dvector_ops_simple_test.cc67 std::vector<float> exponents; in XLA_TEST_F() local
68 exponents.reserve(count); in XLA_TEST_F()
70 exponents.push_back(i / static_cast<float>(count)); in XLA_TEST_F()
72 auto x = ConstantR1<float>(&builder, exponents); in XLA_TEST_F()
76 expected.reserve(exponents.size()); in XLA_TEST_F()
77 for (float exponent : exponents) { in XLA_TEST_F()
88 Array4D<float> exponents(2, 2, 2, 2); in XLA_TEST_F() local
92 for (int i = 0; i < exponents.num_elements(); ++i) { in XLA_TEST_F()
94 exponents.num_elements()); in XLA_TEST_F()
97 exponents.SetValues(exponents_vector); in XLA_TEST_F()
[all …]
/external/eigen/Eigen/src/Core/
DGlobalFunctions.h132 pow(const Eigen::ArrayBase<Derived>& x, const Eigen::ArrayBase<ExponentDerived>& exponents) in pow() argument
136 exponents.derived() in pow()
161 pow(const Scalar& x, const Eigen::ArrayBase<Derived>& exponents) in pow() argument
164 …internal::plain_constant_type<Derived,Scalar>::type(exponents.rows(), exponents.cols(), x), expone… in pow()
169 pow(const typename Derived::Scalar& x, const Eigen::ArrayBase<Derived>& exponents) in EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE()
172 …nstant_type<Derived,typename Derived::Scalar>::type(exponents.rows(), exponents.cols(), x), expone… in EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE()
/external/epid-sdk/epid/member/src/
Dpresig.c255 BigNumStr const* exponents[4]; in MemberComputePreSig() local
260 exponents[0] = &t1_str; in MemberComputePreSig()
261 exponents[1] = &kOne; in MemberComputePreSig()
262 exponents[2] = &t2_str; in MemberComputePreSig()
263 exponents[3] = (BigNumStr*)&precompsig->ra; in MemberComputePreSig()
264 sts = FfMultiExp(GT, points, exponents, COUNT_OF(points), R2); in MemberComputePreSig()
Dsignbasic.c216 BigNumStr const* exponents[4]; in EpidSignBasic() local
221 exponents[0] = &t1_str; in EpidSignBasic()
222 exponents[1] = &kOne; in EpidSignBasic()
223 exponents[2] = &t2_str; in EpidSignBasic()
224 exponents[3] = (BigNumStr*)&curr_presig.ra; in EpidSignBasic()
225 sts = FfMultiExp(GT, points, exponents, COUNT_OF(points), R2); in EpidSignBasic()
Dnrprove.c169 BigNumStr const* exponents[2]; in EpidNrProve() local
172 exponents[0] = &mu_str; in EpidNrProve()
173 exponents[1] = &nu_str; in EpidNrProve()
174 sts = EcSscmMultiExp(G1, points, exponents, COUNT_OF(points), t); in EpidNrProve()
/external/guava/guava-tests/benchmark/com/google/common/math/
DLongMathBenchmark.java36 private static final int[] exponents = new int[ARRAY_SIZE]; field in LongMathBenchmark
46 exponents[i] = randomExponent(); in setUp()
62 tmp += LongMath.pow(positive[j], exponents[j]); in pow()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/spec/
DECNamedCurveSpec.java45 int[] exponents = poly.getExponentsPresent(); in convertField() local
46 int[] ks = Arrays.reverse(Arrays.copyOfRange(exponents, 1, exponents.length - 1)); in convertField()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jce/spec/
DECNamedCurveSpec.java47 int[] exponents = poly.getExponentsPresent(); in convertField() local
48 int[] ks = Arrays.reverse(Arrays.copyOfRange(exponents, 1, exponents.length - 1)); in convertField()
/external/python/cpython3/Modules/_decimal/libmpdec/literature/
Dfnt.py65 def is_primitive_root(r, p, factors, exponents): argument
67 if p != prod(factors, exponents) + 1:
/external/tensorflow/tensorflow/contrib/distributions/python/ops/bijectors/
Dcholesky_outer_product.py177 exponents = math_ops.linspace(p_float, 1., p_int)
181 exponents[..., array_ops.newaxis]),
/external/eigen/test/
Darray.cpp113 ArrayType exponents = ArrayType::Constant(rows, cols, RealScalar(2)); in array() local
114 VERIFY_IS_APPROX(Eigen::pow(m1,exponents), m1.square()); in array()
115 VERIFY_IS_APPROX(m1.pow(exponents), m1.square()); in array()
116 VERIFY_IS_APPROX(Eigen::pow(2*m1,exponents), 4*m1.square()); in array()
117 VERIFY_IS_APPROX((2*m1).pow(exponents), 4*m1.square()); in array()
118 VERIFY_IS_APPROX(Eigen::pow(m1,2*exponents), m1.square().square()); in array()
119 VERIFY_IS_APPROX(m1.pow(2*exponents), m1.square().square()); in array()
120 VERIFY_IS_APPROX(Eigen::pow(m1(0,0), exponents), ArrayType::Constant(rows,cols,m1(0,0)*m1(0,0))); in array()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/
DEC5Util.java258 int[] exponents = poly.getExponentsPresent(); in convertField() local
259 int[] ks = Arrays.reverse(Arrays.copyOfRange(exponents, 1, exponents.length - 1)); in convertField()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jcajce/provider/asymmetric/util/
DEC5Util.java262 int[] exponents = poly.getExponentsPresent(); in convertField() local
263 int[] ks = Arrays.reverse(Arrays.copyOfRange(exponents, 1, exponents.length - 1)); in convertField()
/external/tensorflow/tensorflow/python/kernel_tests/signal/
Dreconstruction_ops_test.py43 exponents = np.array(range(self.frames * self.samples))
44 powers = np.power(self.bases[:, np.newaxis], exponents[np.newaxis, :])
/external/wycheproof/doc/
Ddh.md6 Diffie-Hellman keys can be found much faster if the short exponents are used and
77 [OW96]: P. C. van Oorschot, M. J. Wiener, "On Diffie-Hellman key agreement with short exponents",
/external/ukey2/src/main/proto/
Dsecuremessage.proto103 // A convenience proto for encoding RSA public keys with small exponents

1234