ecfieldelement.java

J2ME加密算法的代码!里面包括常用的算法

         * represents the reduction polynomial <code>f(z)</code>.
         * @param x The BigInteger representing the value of the field element.
         */
        public F2m(
            int m, 
            int k1, 
            int k2, 
            int k3,
            BigInteger x)
        {
            super(x);

            if ((k2 == 0) && (k3 == 0))
            {
                this.representation = TPB;
            }
            else
            {
                if (k2 >= k3)
                {
                    throw new IllegalArgumentException(
                            "k2 must be smaller than k3");
                }
                if (k2 <= 0)
                {
                    throw new IllegalArgumentException(
                            "k2 must be larger than 0");
                }
                this.representation = PPB;
            }

            if (x.signum() < 0)
            {
                throw new IllegalArgumentException("x value cannot be negative");
            }

            this.m = m;
            this.k1 = k1;
            this.k2 = k2;
            this.k3 = k3;
        }

        /**
         * Constructor for TPB.
         * @param m  The exponent <code>m</code> of
         * <code>F<sub>2<sup>m</sup></sub></code>.
         * @param k The integer <code>k</code> where <code>x<sup>m</sup> +
         * x<sup>k</sup> + 1</code> represents the reduction
         * polynomial <code>f(z)</code>.
         * @param x The BigInteger representing the value of the field element.
         */
        public F2m(int m, int k, BigInteger x)
        {
            // Set k1 to k, and set k2 and k3 to 0
            this(m, k, 0, 0, x);
        }

        public String getFieldName()
        {
            return "F2m";
        }
        
        /**
         * Checks, if the ECFieldElements <code>a</code> and <code>b</code>
         * are elements of the same field <code>F<sub>2<sup>m</sup></sub></code>
         * (having the same representation).
         * @param a field element.
         * @param b field element to be compared.
         * @throws IllegalArgumentException if <code>a</code> and <code>b</code>
         * are not elements of the same field
         * <code>F<sub>2<sup>m</sup></sub></code> (having the same
         * representation). 
         */
        public static void checkFieldElements(
            ECFieldElement a,
            ECFieldElement b)
        {
            if ((!(a instanceof F2m)) || (!(b instanceof F2m)))
            {
                throw new IllegalArgumentException("Field elements are not "
                        + "both instances of ECFieldElement.F2m");
            }

            if ((a.x.signum() < 0) || (b.x.signum() < 0))
            {
                throw new IllegalArgumentException(
                        "x value may not be negative");
            }

            ECFieldElement.F2m aF2m = (ECFieldElement.F2m)a;
            ECFieldElement.F2m bF2m = (ECFieldElement.F2m)b;

            if ((aF2m.m != bF2m.m) || (aF2m.k1 != bF2m.k1)
                    || (aF2m.k2 != bF2m.k2) || (aF2m.k3 != bF2m.k3))
            {
                throw new IllegalArgumentException("Field elements are not "
                        + "elements of the same field F2m");
            }

            if (aF2m.representation != bF2m.representation)
            {
                // Should never occur
                throw new IllegalArgumentException(
                        "One of the field "
                                + "elements are not elements has incorrect representation");
            }
        }

        /**
         * Computes <code>z * a(z) mod f(z)</code>, where <code>f(z)</code> is
         * the reduction polynomial of <code>this</code>.
         * @param a The polynomial <code>a(z)</code> to be multiplied by
         * <code>z mod f(z)</code>.
         * @return <code>z * a(z) mod f(z)</code>
         */
        private BigInteger multZModF(final BigInteger a)
        {
            // Left-shift of a(z)
            BigInteger az = a.shiftLeft(1);
            if (az.testBit(this.m)) 
            {
                // If the coefficient of z^m in a(z) equals 1, reduction
                // modulo f(z) is performed: Add f(z) to to a(z):
                // Step 1: Unset mth coeffient of a(z)
                az = az.clearBit(this.m);

                // Step 2: Add r(z) to a(z), where r(z) is defined as
                // f(z) = z^m + r(z), and k1, k2, k3 are the positions of
                // the non-zero coefficients in r(z)
                az = az.flipBit(0);
                az = az.flipBit(this.k1);
                if (this.representation == PPB) 
                {
                    az = az.flipBit(this.k2);
                    az = az.flipBit(this.k3);
                }
            }
            return az;
        }

        public ECFieldElement add(final ECFieldElement b)
        {
            // No check performed here for performance reasons. Instead the
            // elements involved are checked in ECPoint.F2m
            // checkFieldElements(this, b);
            if (b.x.signum() == 0)
            {
                return this;
            }

            return new F2m(this.m, this.k1, this.k2, this.k3, this.x.xor(b.x));
        }

        public ECFieldElement subtract(final ECFieldElement b)
        {
            // Addition and subtraction are the same in F2m
            return add(b);
        }


        public ECFieldElement multiply(final ECFieldElement b)
        {
            // Left-to-right shift-and-add field multiplication in F2m
            // Input: Binary polynomials a(z) and b(z) of degree at most m-1
            // Output: c(z) = a(z) * b(z) mod f(z)

            // No check performed here for performance reasons. Instead the
            // elements involved are checked in ECPoint.F2m
            // checkFieldElements(this, b);
            final BigInteger az = this.x;
            BigInteger bz = b.x;
            BigInteger cz;

            // Compute c(z) = a(z) * b(z) mod f(z)
            if (az.testBit(0)) 
            {
                cz = bz;
            } 
            else 
            {
                cz = ECConstants.ZERO;
            }

            for (int i = 1; i < this.m; i++) 
            {
                // b(z) := z * b(z) mod f(z)
                bz = multZModF(bz);

                if (az.testBit(i)) 
                {
                    // If the coefficient of x^i in a(z) equals 1, b(z) is added
                    // to c(z)
                    cz = cz.xor(bz);
                }
            }
            return new ECFieldElement.F2m(m, this.k1, this.k2, this.k3, cz);
        }


        public ECFieldElement divide(final ECFieldElement b)
        {
            // There may be more efficient implementations
            ECFieldElement bInv = b.invert();
            return multiply(bInv);
        }

        public ECFieldElement negate()
        {
            // -x == x holds for all x in F2m
            return this;
        }

        public ECFieldElement square()
        {
            // Naive implementation, can probably be speeded up using modular
            // reduction
            return multiply(this);
        }

        public ECFieldElement invert()
        {
            // Inversion in F2m using the extended Euclidean algorithm
            // Input: A nonzero polynomial a(z) of degree at most m-1
            // Output: a(z)^(-1) mod f(z)

            // u(z) := a(z)
            BigInteger uz = this.x;
            if (uz.signum() <= 0) 
            {
                throw new ArithmeticException("x is zero or negative, " +
                        "inversion is impossible");
            }

            // v(z) := f(z)
            BigInteger vz = ECConstants.ONE.shiftLeft(m);
            vz = vz.setBit(0);
            vz = vz.setBit(this.k1);
            if (this.representation == PPB) 
            {
                vz = vz.setBit(this.k2);
                vz = vz.setBit(this.k3);
            }

            // g1(z) := 1, g2(z) := 0
            BigInteger g1z = ECConstants.ONE;
            BigInteger g2z = ECConstants.ZERO;

            // while u != 1
            while (!(uz.equals(ECConstants.ZERO))) 
            {
                // j := deg(u(z)) - deg(v(z))
                int j = uz.bitLength() - vz.bitLength();

                // If j < 0 then: u(z) <-> v(z), g1(z) <-> g2(z), j := -j
                if (j < 0) 
                {
                    final BigInteger uzCopy = uz;
                    uz = vz;
                    vz = uzCopy;

                    final BigInteger g1zCopy = g1z;
                    g1z = g2z;
                    g2z = g1zCopy;

                    j = -j;
                }

                // u(z) := u(z) + z^j * v(z)
                // Note, that no reduction modulo f(z) is required, because
                // deg(u(z) + z^j * v(z)) <= max(deg(u(z)), j + deg(v(z)))
                // = max(deg(u(z)), deg(u(z)) - deg(v(z)) + deg(v(z))
                // = deg(u(z))
                uz = uz.xor(vz.shiftLeft(j));

                // g1(z) := g1(z) + z^j * g2(z)
                g1z = g1z.xor(g2z.shiftLeft(j));
//                if (g1z.bitLength() > this.m) {
//                    throw new ArithmeticException(
//                            "deg(g1z) >= m, g1z = " + g1z.toString(2));
//                }
            }
            return new ECFieldElement.F2m(
                    this.m, this.k1, this.k2, this.k3, g2z);
        }

        public ECFieldElement sqrt()
        {
            throw new RuntimeException("Not implemented");
        }

        /**
         * @return the representation of the field
         * <code>F<sub>2<sup>m</sup></sub></code>, either of
         * TPB (trinomial
         * basis representation) or
         * PPB (pentanomial
         * basis representation).
         */
        public int getRepresentation()
        {
            return this.representation;
        }

        /**
         * @return the degree <code>m</code> of the reduction polynomial
         * <code>f(z)</code>.
         */
        public int getM()
        {
            return this.m;
        }

        /**
         * @return TPB: The integer <code>k</code> where <code>x<sup>m</sup> +
         * x<sup>k</sup> + 1</code> represents the reduction polynomial
         * <code>f(z)</code>.<br>
         * PPB: The integer <code>k1</code> where <code>x<sup>m</sup> +
         * x<sup>k3</sup> + x<sup>k2</sup> + x<sup>k1</sup> + 1</code>
         * represents the reduction polynomial <code>f(z)</code>.<br>
         */
        public int getK1()
        {
            return this.k1;
        }

        /**
         * @return TPB: Always returns <code>0</code><br>
         * PPB: The integer <code>k2</code> where <code>x<sup>m</sup> +
         * x<sup>k3</sup> + x<sup>k2</sup> + x<sup>k1</sup> + 1</code>
         * represents the reduction polynomial <code>f(z)</code>.<br>
         */
        public int getK2()
        {
            return this.k2;
        }

        /**
         * @return TPB: Always set to <code>0</code><br>
         * PPB: The integer <code>k3</code> where <code>x<sup>m</sup> +
         * x<sup>k3</sup> + x<sup>k2</sup> + x<sup>k1</sup> + 1</code>
         * represents the reduction polynomial <code>f(z)</code>.<br>
         */
        public int getK3()
        {
            return this.k3;
        }

        public boolean equals(Object anObject)
        {
            if (anObject == this) 
            {
                return true;
            }

            if (!(anObject instanceof ECFieldElement.F2m)) 
            {
                return false;
            }

            ECFieldElement.F2m b = (ECFieldElement.F2m)anObject;
            
            return ((this.m == b.m) && (this.k1 == b.k1) && (this.k2 == b.k2)
                && (this.k3 == b.k3)
                && (this.representation == b.representation)
                && (this.x.equals(b.x)));
        }

        public int hashCode()
        {
            return x.hashCode() ^ m ^ k1 ^ k2 ^ k3;
        }
    }    
}