MATH5248: Cryptology and Number Theory

4 Credits

Classical cryptosystems. One-time pads, perfect secrecy. Public key ciphers: RSA, discrete log. Euclidean algorithm, finite fields, quadratic reciprocity. Message digest, hash functions. Protocols: key exchange, secret sharing, zero-knowledge proofs. Probablistic algorithms: pseudoprimes, prime factorization. Pseudo-random numbers. Elliptic curves. prereq: 2 sems soph math

View on University Catalog

All Instructors

B+ Average (3.348)Most Common: A (38%)

This total also includes data from semesters with unknown instructors.

1251 students
SNWFDCBA

  • 4.06

    /5

    Recommend

  • 4.00

    /5

    Effort

  • 4.32

    /5

    Understanding

  • 4.00

    /5

    Interesting

  • 4.06

    /5

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Fall 2024 provided by the Office of Institutional Data and Research

      Privacy Policy