Cryptography and Computer Security for Undergraduates Suzanne E. Gladfelter Penn State York sgladfelter@psu.edu www.yk.psu.edu/~sg3 March 4, 2004

Course Overview Introductory course Team taught, multidisciplinary Pre-requisites 5th semester standing (juniors) Completed college algebra Minimal computing experience (user) Multidisciplinary team (history, math, computer science) IST students have taken a discrete math course (with a 4- credit calculus pre-requisite) No programming experience needed (want to attract a broad audience) IST students CS1 Most students have taken CS1 March 4, 2004 ACM SIGCSE - Norfolk, VA

Course Content “Computing is a broad field that extends beyond the boundaries of computer science” (CC2001) Science, Technology & Society www.yk.psu.edu/~sg3/sts497a Bibliography of resources According to CC2001…..we structured our course in that spirit March 4, 2004 ACM SIGCSE - Norfolk, VA

Course Content Strong historical component Mathematics Number theory Relevant math as needed to discuss RSA & PGP Computer Science Tie together and implement Historical algorithms History Where crypto fits into the “big picture” Evolution of cryptography Mathematics Glassy-eyed students (RSA proof) Computer science Students use software to experiment with historical algorithms & math Students write programs to implement algorithms (choose as homework) March 4, 2004 ACM SIGCSE - Norfolk, VA

Where Does This Course “Fit” in CS/IST Curriculum? Elective Support course Fulfill general education requirements March 4, 2004 ACM SIGCSE - Norfolk, VA

How is cryptography integrated into CS/IST curriculum? CS0 / IST Intro Programming / Algorithms Network security / Wireless Database / Mobile technologies Web technologies / E-commerce Integrate whenever and where ever possible – don’t teach crypto in isolation Core courses CS0/IST intro Hacking passwords Social engineering Programming Easy to implement simple applications as soon as can handle strings/arrays March 4, 2004 ACM SIGCSE - Norfolk, VA

CC2001 - Cryptography Topics AL9. Cryptographic algorithms [elective] Topics: √ Historical overview of cryptography √ Private-key cryptography and the key-exchange problem √ Public-key cryptography √ Digital signatures Security protocols Applications (zero-knowledge proofs, authentication, and so on) NC3. Network security [core] Minimum core coverage time: 3 hours Topics: √ Fundamentals of cryptography √ Secret-key algorithms √ Public-key algorithms Authentication protocols √ Digital signatures √ Examples √  Topic is covered in STS 497A March 4, 2004 ACM SIGCSE - Norfolk, VA

CC2001 – Cryptography Learning Objectives AL9. Cryptographic algorithms [elective] Learning objectives: √ Describe efficient basic number-theoretic algorithms, including greatest common divisor, multiplicative inverse mod n, and raising to powers mod n. √ Describe at least one public-key cryptosystem, including a necessary complexity-theoretic assumption for its security. NC3. Network security [core] Minimum core coverage time: 3 hours Learning objectives: √ Discuss the fundamental ideas of public-key cryptography. √ Describe how public-key cryptography works. √ Distinguish between the use of private- and public-key algorithms. Summarize common authentication protocols. √ Generate and distribute a PGP key pair and use the PGP package to send an encrypted e-mail message. √ Summarize the capabilities and limitations of the means of cryptography that are conveniently available to the general public. √  learning objective is addressed in STS 497A March 4, 2004 ACM SIGCSE - Norfolk, VA

PSU Center of Academic Excellence for Information Assurance Education http://net1.ist.psu.edu/cica/home.htm http://net1.ist.psu.edu/cica/ March 4, 2004 ACM SIGCSE - Norfolk, VA