Symmetric Ciphers Questions and Answers – Polynomial and Modular Arithmetic – II

This set of Advanced Cryptography Questions and Answers focuses on “Polynomial and Modular Arithmetic – II”.

1. If f(x)=x7+x5+x4+x3+x+1 and g(x)=x3+x+1, find f(x) x g(x).
a) x12+x5+x3+x2+x+1
b) x10+x4+1
c) x10+x4+x+1
d) x7+x5+x+1
View Answer

Answer: c
Explanation: Perform Modular Multiplication.

2. If f(x)=x7+x5+x4+x3+x+1 and g(x)=x3+x+1, find the quotient of f(x) / g(x).
a) x4+x3+1
b) x4+1
c) x5+x3+x+1
d) x3+x2
View Answer

Answer: b
Explanation: Perform Modular Division.

3. Primitive Polynomial is also called a ____
i) Perfect Polynomial
ii) Prime Polynomial
iii) Irreducible Polynomial
iv) Imperfect Polynomial

advertisement
advertisement

a) ii) and iii)
b) only iii)
c) iv) and ii)
d) None
View Answer

Answer: a
Explanation: Irreducible polynomial is also called a prime polynomial or primitive polynomial.

4. Which of the following are irreducible polynomials?
i) X4+X3
ii) 1
iii) X2+1
iv) X4+X+1

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

a) i) and ii)
b) only iv)
c) ii) iii) and iv)
d) All of the options
View Answer

Answer: d
Explanation: All of the mentioned are irreducible polynomials.

5. The polynomial f(x)=x3+x+1 is a reducible.
a) True
b) False
View Answer

Answer: b
Explanation: f(x)=x3+x+1 is irreducible.
advertisement

6. Find the HCF/GCD of x6+x5+x4+x3+x2+x+1 and x4+x2+x+1.
a) x4+x3+x2+1
b) x3+x2+1
c) x2+1
d) x3+x2+1
View Answer

Answer: b
Explanation: Use Euclidean Algorithm and find the GCD. GCD = x3+x2+1.

7. On multiplying (x5 + x2 + x) by (x7 + x4 + x3 + x2 + x) in GF(28) with irreducible polynomial (x8 + x4 + x3 + x + 1) we get
a) x12+x7+x2
b) x5+x3+x3
c) x5+x3+x2+x
d) x5+x3+x2+x+1
View Answer

Answer: d
Explanation: Multiplication gives us (x12 + x7 + x2) mod (x8 + x4 + x3 + x + 1).
Reducing this via modular division gives us, (x5+x3+x2+x+1)
advertisement

8. On multiplying (x6+x4+x2+x+1) by (x7+x+1) in GF(28) with irreducible polynomial (x8 + x4 + x3 + x + 1) we get
a) x7+x6+ x3+x2+1
b) x6+x5+ x2+x+1
c) x7+x6+1
d) x7+x6+x+1
View Answer

Answer: c
Explanation: Multiply and Obtain the modulus we get the polynomial product as x7+x6+1.

9. Find the inverse of (x2 + 1) modulo (x4 + x + 1).
a) x4+ x3+x+1
b) x3+x+1
c) x3+ x2+x
d) x2+x
View Answer

Answer: b
Explanation:
The inverse of (x2 + 1) modulo (x4 + x + 1) is x3+x+1

10. Find the inverse of (x5) modulo (x8+x4 +x3+ x + 1).
a) x5+ x4+ x3+x+1
b) x5+ x4+ x3
c) x5+ x4+ x3+1
d) x4+ x3+x+1
View Answer

Answer: c
Explanation: Finding the inverse with respect to (x8+x4 +x3+ x + 1) we get x5+ x4+ x3+1 as the inverse.

Sanfoundry Global Education & Learning Series – Cryptography and Network Security.

To practice advanced questions on all areas of Cryptography, here is complete set of 1000+ Multiple Choice Questions and Answers

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.