A number such that .

A number such that the numbers generate all integers from to in some order.

A number such that .

know the private key of at least one of the two parties.

create a new private key for each of the two parties.

eavesdrop on the communication between the two parties without acting actively.

know the private keys of both the parties.

Public Key Crypto is based on small prime numbers that create finite fields of polynomials.

In Public Key Cryptography, every pair of users needs a shared secret key.

In contrast to Symmetric Key Cryptography, Public Key Cryptography is based on the secrecy on the algorithm, not the secrecy of the key.

In a Public Key Cryptosystem like RSA, messages (i.e., the number m representing them) must always be smaller than the modulo n=pq.

... find the multiplicative inverse for an AES 128-bit key under GF(2^8).

... break a Diffie-Hellman Key, i.e., find a secret A by overhearing g^A mod p.

... find the private key d in the RSA key generation process.

... helps finding the prime factors of a large number.

These are first five prime numbers, any other prime number would be larger.

Because they make encryption faster.

Because these numbers have a common factor with (p-1)(q-1).

Because they are all prime numbers

AES with a key size of 128 bits has 10 rounds.

AES operates in GF(2^8).

All AES rounds are identical.

AES encryption and decryption are not identical, i.e., they require (slightly) different algorithms.