public static int multiply( int a , int b ) {
		int z = 0;

		for (int i = 0; (b>>i) > 0; i++) {
			if( (b & (1 << i)) != 0 ) {
				z ^= a << i;
			}
		}
		return z;
	}
public static int multiply ( int a , int b ) { int z = 0 ; for ( int i = 0 ; ( b > > i ) > 0 ; i ++ ) { if ( ( b & ( 1 << i ) ) != 0 ) { z ^= a << i ; } } return z ; }
<p>Multiply the two polynomials together. The technique used here isn't the fastest but is easy
to understand.</p>

<p>NOTE: No modulus operation is performed so the result might not be a member of the same field.</p>

@param a polynomial
@param b polynomial
@return result polynomial