INTRODUCTION TO CRYPTOGRAPHY

ECE 555

Principles and characterization of logic circuits. Design and analysis techniques for applied logic circuits. Transmission lines in digital applications. Families of circuit logic currently in use and their characteristics.

COMPSCI 812

Survey of algorithms and design paradigms for exact arithmetic, as used in public-key cryptography, computer algebra, and pseudo-random number generation. Topics include primality testing, factorization of integers and polynomials, discrete logarithms, and (optionally) elliptic curves and integer lattices. Students are strongly encourage to have knowledge of basic abstract algebra (e.g.,MATH 541), and intermediate programming ability (e.g., COMP SCI 367 orCOMP SCI 300).

COMPSCI/ECE 763

Explore security and privacy aspects of trustworthy artificial intelligence. Three core subjects will be considered: differential privacy and algorithmic fairness; adversarial machine learning; and end-to-end trustworthy systems. A selection of more advanced topics may be covered such as additional notions of privacy, language-based security, and robust optimization. Knowledge of probability/statistics (such as MATH 431), cryptography (such as MATH 435), security (such asCOMP SCI 642), and modern machine learning (such asM E/​COMP SCI/​E C E  539or540) is required.

COMPSCI 880

Advanced topics in algorithms, complexity, and cryptography. The exact topic varies.

COMPSCI 642

Senior level undergraduate course covering various topics on information security. Covers a wide range of topics, such as cryptographic primitives, security protocols, system security, and emerging topics. Elementary knowledge of mathematical logic and discrete probability theory needed, such asMATH/​COMP SCI  240.