/** * returns <tt>this</tt> element + 1. * * @return <tt>this</tt> + 1 */ public GF2nElement increase() { GF2nONBElement result = new GF2nONBElement(this); result.increaseThis(); return result; }
long[] pol = getElement(); assign(pol);
/** * returns <tt>this</tt> element to the power of 2. * * @return <tt>this</tt><sup>2</sup> */ public GF2nElement square() { GF2nONBElement result = new GF2nONBElement(this); result.squareThis(); return result; }
if (isZero()) GF2nElement m = ZERO((GF2nONBField)mField); GF2nElement n = new GF2nONBElement(this);
if (equals(factor)) squareThis(); assign(c);
/** * returns the root of<tt>this</tt> element. * * @return <tt>this</tt><sup>1/2</sup> */ public GF2nElement squareRoot() { GF2nONBElement result = new GF2nONBElement(this); result.squareRootThis(); return result; }
/** * Compute the sum of this element and <tt>addend</tt>. * * @param addend the addend * @return <tt>this + other</tt> (newly created) */ public GFElement add(GFElement addend) throws RuntimeException { GF2nONBElement result = new GF2nONBElement(this); result.addToThis(addend); return result; }
/** * Compute the multiplicative inverse of this element. * * @return <tt>this<sup>-1</sup></tt> (newly created) * @throws ArithmeticException if <tt>this</tt> is the zero element. */ public GFElement invert() throws ArithmeticException { GF2nONBElement result = new GF2nONBElement(this); result.invertThis(); return result; }
/** * Compute the product of this element and <tt>factor</tt>. * * @param factor the factor * @return <tt>this * factor</tt> (newly created) */ public GFElement multiply(GFElement factor) throws RuntimeException { GF2nONBElement result = new GF2nONBElement(this); result.multiplyThisBy(factor); return result; }
if (trace() == 1) return new GF2nONBElement((GF2nONBField)mField, p);
u = new GF2nONBElement(this, new Random()); ut = new GF2nPolynomial(2, GF2nONBElement.ZERO(this));
((GF2nONBElement)elemCopy).reverseOrder(); GF2nONBElement res = new GF2nONBElement((GF2nONBField)basis, result.toFlexiBigInt()); res.reverseOrder(); return res;
/** * assigns to this element the value <tt>val</tt>. * * @param val the value represented by a BigInteger */ private void assign(BigInteger val) { assign(val.toByteArray()); }
/** * Create a new GF2nONBElement by cloning this GF2nPolynomialElement. * * @return a copy of this element */ public Object clone() { return new GF2nONBElement(this); }
res[i] = GF2nONBElement.ZERO((GF2nONBField)f);
/** * Reverses the bit-order in this element(according to 1363). This is a * hack! */ void reverseOrder() { mPol = getElementReverseOrder(); }
long[] a = getElement(); int b = mBit;
gamma[mDegree - 1] = GF2nONBElement.ONE((GF2nONBField)B1);