Home
last modified time | relevance | path

Searched refs:modReduce (Results 1 – 2 of 2) sorted by relevance

/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DECFieldElement.java180 return new Fp(q, r, modReduce(ab.subtract(xy))); in multiplyMinusProduct()
188 return new Fp(q, r, modReduce(ab.add(xy))); in multiplyPlusProduct()
211 return new Fp(q, r, modReduce(aa.subtract(xy))); in squareMinusProduct()
219 return new Fp(q, r, modReduce(aa.add(xy))); in squarePlusProduct()
296 … || !modReduce(P.multiply(P).subtract(fourX)).modPow(legendreExponent, q).equals(qMinusOne)); in sqrt()
343 Vl = modReduce(Vh.multiply(Vl).subtract(P.multiply(Ql))); in lucasSequence()
344 Vh = modReduce(Vh.multiply(Vh).subtract(Qh.shiftLeft(1))); in lucasSequence()
349 Uh = modReduce(Uh.multiply(Vl).subtract(Ql)); in lucasSequence()
350 Vh = modReduce(Vh.multiply(Vl).subtract(P.multiply(Ql))); in lucasSequence()
351 Vl = modReduce(Vl.multiply(Vl).subtract(Ql.shiftLeft(1))); in lucasSequence()
[all …]
DLongArray.java1339 public LongArray modReduce(int m, int[] ks) in modReduce() method in LongArray