Assess students' ability to recall formal definitions and canonical instances of core cryptographic hardness assumptions: the RSA/integer factorization problem, the discrete logarithm problem in multiplicative groups, the elliptic-curve discrete logarithm problem (ECDLP), and Learning With Errors (LWE). Expect concise descriptions of the computational tasks (search vs. decisional variants), standard hardness statements, typical parameter choices and example instantiations (e.g., RSA modulus, prime-order subgroup, named curve over F_p, LWE dimension/modulus/noise).