IAS CH4 QUIZ

Finite fields play a crucial role in several areas of cryptography.

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.

Two integers a and b are said to be congruent modulo n, if

(a mod n) = (b mod n).

Cryptographic algorithms do not rely on properties of finite fields.

Finite fields of order p can be defined using arithmetic mod p.

The Advanced Encryption Standard uses infinite fields.

The rules for ordinary arithmetic involving addition, subtraction,

and multiplication carry over into modular arithmetic.

A cyclic group is always commutative and may be finite or infinite.

A field is a set in which we can do addition, subtraction,

multiplication and division without leaving the set.

It 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.