Crypto

Front

What is the result of 23mod 7?

Back

3

Front

What is the multiplicative inverse of 3 modulo 7?

Back

5

Front

The set of integers under multiplication modulo 10 forms a field.

Back

false

Front

The Euclidean algorithm is used to compute the ________ of two numbers

Back

GCD

Front

Which of the following algorithms is used for key exchange: RSA, RC4, Diffie-Hellman, AES?

Back

Diffie-Hellman

Front

In RC4, the keystream is generated using

Back

XOR

Front

RC4 is considered secure for modern encryption

Back

False

Front

Fermat’s Little Theorem states that if p is a prime number and a is not divisible by p, then a^(p - 1) mod p = ________

Back

1

Front

The RSA algorithm is based on the difficulty of

Back

Factoring large prime numbers

Front

In RSA, the public key is represented by

Back

(n, e)