(3 units). The notion of secure communication. Building secure cryptosystems based on the assumption of computational hardness. Cryptographic one-way functions, trap-door functions, pseudorandom generators, and public/private-key encryption schemes. Computational indistinguishable and unpredictability. Digital signature and message authentication. Zero-knowledge/interactive proof systems. Application to e-commerce and e-trade. Course Component: Lecture Prerequisites: 9 course units in computer science (CSI) or software engineering (SEG) at the 3000 or 4000 level.
(3 units). The notion of secure communication. Building secure cryptosystems based on the assumption of computational hardness. Cryptographic one-way functions, trap-door functions, pseudorandom generators, and public/private-key encryption schemes. Computational indistinguishable and unpredictability. Digital signature and message authentication. Zero-knowledge/interactive proof systems. Application to e-commerce and e-trade. Course Component: Lecture Prerequisites: 9 course units in computer science (CSI) or software engineering (SEG) at the 3000 or 4000 level.
