Assess students' factual recall of core properties and parameters of RSA, ECC, and ElGamal: expected/key-size ranges (classical security and brief post‑quantum note), primary hardness assumptions (integer factorization, discrete log, elliptic-curve discrete log), typical parameter choices, and common applications (encryption, signatures, key exchange). Focus on mapping algorithms to assumptions, comparing equivalent security levels, and identifying standard use-cases.