MA4550 Combinatorial and Cryptographic Properties of Boolean Functions

The course will discuss the Fourier analysis of Boolean functions and the relevant combinatorics with an eye toward cryptography and coding theory. Particular topics will include avalanche features of Boolean functions, correlation immunity and resiliency, bentness, trade-offs among cryptographic criteria and real-life applications in the designs of stream and block ciphers.

Prerequisite

MA3025 or a similar combinatorial/discrete mathematics course (and recommended, but not required, an introductory course in probability)

Lecture Hours

4

Lab Hours

0

Quarter Offered

  • As Required