Master of Mathematics in Combinatorics and Optimization - Co-operative Program (Cryptography)

University of Waterloo

In classical cryptography, some algorithm, depending on a secret piece of information called the key, which had to be exchanged in secret in advance of communication, was used to scramble and descramble messages. (Note that, in a properly designed system, the secrecy should rely only on the key. It should be assumed that the algorithm is known to the opponent.) In 1976, a new type of cryptosystem, called an asymmetric or public-key system was conceived. In these systems, the roles of encryption and decryption are sufficiently separated that the key for one of these functions can be publicly disclosed, while the other can be maintained in secret. This eliminates the need for the exchange of keys in secret prior to communication. These constructions are based on the computational infeasibility of solving certain hard mathematical problems such as integer factorization. The search for appropriate hard problems and the design and analysis of related public key systems has given rise to a very active and stimulating area of research. Research, both theoretical and practical, in various areas of cryptography, security and privacy is being undertaken at the Centre for Applied Cryptographic Research (CACR) at Waterloo. Some areas of focus for cryptographers in the C&O department include elliptic and hyperelliptic curve cryptography, pairing-based cryptography, quantum-safe cryptography, and the design and analysis of cryptographic protocols.