Q. Multiply 00100110 by 10011110 in GF(2^8) with modulus 100011011.The result is

View solution

Q. Find the inverse of (x^7+x+1) modulo (x^8 + x^4 + x^3+ x + 1).

View solution

Q. 7x = 6 mod 5. Then the value of x is

View solution

Q. State whether the following statement is true or false over a field.

The product of monic polynomials is monic.

View solution

Q. State whether the following statement is true or false over a field.

The product of polynomials of degrees m and n has a degree m+n+1.

View solution

Q. State whether the following statement is true or false over a field.

The sum of polynomials of degrees m and n has degree max[m,n].

View solution

Q. Is x^3 + 1 reducible over GF(2)

View solution

Q. Is x^3 + x^2 + 1 reducible over GF(2)

View solution

Q. Is x^4 + 1 reducible over GF(2)

View solution

Q. The result of (x2 ⊗ P), and the result of (x ⊗ (x ⊗ P)) are the same, where P is a polynomial.

View solution

Q. Find the 8-bit word related to the polynomial x^6 + x + 1

View solution

Q. “An Equations has either no solution or exactly three incongruent solutions”

View solution

Q. Find the solution of x^2 ≡ 3 mod 11

View solution

Q. Find the solution of x^2 ≡ 2 mod 11

View solution

Q. Find the set of quadratic residues in the set –

Z11* = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

View solution

Q. In Zp* with (p-1) elements exactly:

(p – 1)/2 elements are QR and
(p – 1)/2 elements are QNR.

View solution

Q. Find the set of quadratic residues in the set –

Z13* = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,11,12}

View solution

Q. Euler’s Criterion can find the solution to x2 ≡ a (mod n).

View solution

Q. Find the solution of x2≡ 16 mod 23

View solution

Q. Find the solution of x^2 ≡ 3 mod 23

View solution