Cryptography and Computer Security for Undergraduates - PowerPoint PPT Presentation

About This Presentation
Title:

Cryptography and Computer Security for Undergraduates

Description:

Pre-requisites. 5th semester standing (juniors) Completed college algebra. Minimal computing ... 'Computing is a broad field that extends beyond the boundaries ... – PowerPoint PPT presentation

Number of Views:15
Avg rating:3.0/5.0
Slides: 10
Provided by: suzannegl
Category:

less

Transcript and Presenter's Notes

Title: Cryptography and Computer Security for Undergraduates


1
Cryptography and Computer Security for
Undergraduates
  • Suzanne E. Gladfelter
  • Penn State York
  • sgladfelter_at_psu.edu
  • www.yk.psu.edu/sg3

2
Course Overview
  • Introductory course
  • Team taught, multidisciplinary
  • Pre-requisites
  • 5th semester standing (juniors)
  • Completed college algebra
  • Minimal computing experience (user)

3
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

4
Course Content
  • Strong historical component
  • Mathematics
  • Number theory
  • Relevant math as needed to discuss RSA PGP
  • Computer Science
  • Tie together and implement
  • Historical algorithms
  • Mathematics

5
Where Does This Course Fit in CS/IST
Curriculum?
  • Elective
  • Support course
  • Fulfill general education requirements

6
How is cryptography integrated into CS/IST
curriculum?
  • CS0 / IST Intro
  • Programming / Algorithms
  • Network security / Wireless
  • Database / Mobile technologies
  • Web technologies / E-commerce

7
CC2001 - Cryptography Topics
  • AL9. Cryptographic algorithms elective
  • Topics
  • v Historical overview of cryptography
  • v Private-key cryptography and the key-exchange
    problem
  • v Public-key cryptography
  • v Digital signatures
  • Security protocols
  • Applications (zero-knowledge proofs,
    authentication, and so on)
  • NC3. Network security core
  • Minimum core coverage time 3 hours
  • Topics
  • v Fundamentals of cryptography
  • v Secret-key algorithms
  • v Public-key algorithms
  • Authentication protocols
  • v Digital signatures
  • v Examples

8
CC2001 Cryptography Learning Objectives
  • AL9. Cryptographic algorithms elective
  • Learning objectives
  • v Describe efficient basic number-theoretic
    algorithms, including greatest common divisor,
    multiplicative inverse mod n, and raising to
    powers mod n.
  • v 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
  • v Discuss the fundamental ideas of public-key
    cryptography.
  • v Describe how public-key cryptography works.
  • v Distinguish between the use of private- and
    public-key algorithms.
  • Summarize common authentication protocols.
  • v Generate and distribute a PGP key pair and use
    the PGP package to send an encrypted e-mail
    message.
  • v Summarize the capabilities and limitations of
    the means of cryptography that are conveniently
    available to the general public.

9
PSU Center of Academic Excellence for Information
Assurance Education
  • http//net1.ist.psu.edu/cica/home.htm
  • http//net1.ist.psu.edu/cica/
Write a Comment
User Comments (0)
About PowerShow.com