TRUE OR FALSE TF 1. Finite fields play a crucial role in several areas of cryptography F 2. Unlike ordinary addition, there is not an additive inverse to each integer in modular arithmetic. F 3. The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is known as the Brady algorithm. TF 4. Two integers a and b are said to be congruent modulo n, if (a mod n) = (b mod n). T F 5. Cryptographic algorithms do not rely on properties of finite fields. T F TF 7. The Advanced Encryption Standard uses infinite fields. TF 8. The rules for ordinary arithmetic involving addition, subtraction, 6. Finite fields of order p can be defined using arithmetic mod p. and multiplication carry over into modular arithmetic TF 9. A cyclic group is always commutative and may be finite or infinite. T F10. A field is a set in which we can do addition, subtraction, multiplication and division without leaving the set. TF 11. I is easy to find the multiplicative inverse of an element in g(p) for large values of p by constructing a multiplication table, however for small values of p this approach is not practical. TF 12. Polynomial arithmetic includes the operations of addition, subtraction and multiplication. TF 13. If we attempt to perform polynomial division over a coefficient set that is not a field, we find that division is not always defined. T F 14. The euclidean algorithm cannot be adapted to find the multiplicative inverse of a polynomial. T F 15. As a congruence relation, mod expresses that two arguments have