CSCI 391 Practical Cryptology - Spring 2024

Course Information

Lectures:

MWF 1:00 - 1:50 PM, Freedom 303
Canvas course site

Professor:


Dr. Yana Kortsarts
Office: Freedom Hall 313
Phone: (610) - 499 - 4367
e-mail: ykortsarts@widener.edu
homepage: http://cs.widener.edu/~yanako

Office Hours:

Place: In Person Freedom 313 or ON ZOOM: Virtual Office Hours ZOOM link
Time:
• Monday:
  • 9:30 - 10:00 AM, 12:00 - 1:00 PM (In person/ZOOM, Freedom 313)
• Wednesday:
  • 9:30-10:00 AM (In person/ZOOM, Freedom 313
  • 5:00 - 6:00 PM (ZOOM ONLY)
• Friday:
  • 9:30-10:00 AM, 12:00 - 1:00 PM (In person/ZOOM, Freedom 313)
  • 4:30 - 5:00 PM (ZOOM ONLY)
• ADDITIONAL OFFICE HOURS ARE AVAILABLE BY APPOINTMENT ONLY
  YOU MUST SEND AN EMAIL TO ykortsarts@widener.edu TO MAKE AN APPOINTMENT

OPTIONAL Text (not required):

• Introduction to Cryptography with Coding Theory (2nd Edition)
• Wade Trappe (Author), Lawrence C. Washington (Author)
• Publisher: Prentice Hall; 2 edition (July 25, 2005)
• ISBN-10: 0131862391
• ISBN-13: 978-0131862395

Course Description

Cryptology is about making and breaking codes. Cryptology combines cryptography, the study of the methods of encryption, decryption and their use in communications protocols and cryptanalysis, the science of ``breaking'' secret codes, that is, learning how to understand the coded messages without being privy to the method of encoding them. The course covers the historical development of cryptographic methods and cryptanalysis tools. Before modern cryptographic algorithms are discussed in detail, an overview of the classical encryption algorithms is given. Both symmetric (private key) and asymmetric (public key) encryption schemes are presented and analyzed. The course also focuses on methods and algorithms for data integrity and authenticity. Course discusses how encryption algorithms can be used to protect the secrecy of information, build confidence in the identity of remote individuals and in the correctness of data. The study of cryptography requires a mathematical knowledge. We will learn the mathematical background as current topic requires it.

Tentative Course Topics

• Symmetric Ciphers: Substitution Monoalphabetic Ciphers - Caesar, Shift and Affine Ciphers
• Symmetric Polyalphabetic Ciphers: Vigenere Cipher
• Symmetric Block Cipher: Hill Cipher
• Public Key Cryptology: RSA and Knapsack Cryptosystems
• Data Encryption Standard (DES)

Student Learning Outcomes

• Demonstrate understanding of theoretical and practical aspects of cryptology.
• Demonstrate understanding of the classical cryptosystems and the cryptanalysis techniques used to break them.
• Demonstrate understanding of the concept of Public Key (Assymetric) Cryptography.
• Apply their knowledge to encrypt and decrypt messages using both symmetric and public key ciphers.
• Demonstrate understanding the ethical issues involved in cryptology from historical and practical perspectives.
• Apply algorithmic problem-solving techniques to design computational implementations of various symmetric and public key ciphers.

Corresponding Computer Science/Computer Information Systems Outcomes

• 2.1 Design and implement software in multiple languages.
• 2.4 Use proper data structures and algorithms when designing software.
• 4. Demonstrate an understanding of ethical issues and professional responsibilities related to computing and the impact technology has on society.

Corresponding Science Goal

• Employs logical reasoning and problem-solving methodologies to construct algorithms.

Corresponding A&S Goals

• Goal 2: A liberally educated graduate thinks critically.
  • 2.a. Makes claims and draws conclusions that require the analysis and evaluation of evidence.
• Goal 4: A liberally education graduate has developed a wide range of intellectual perspectives and methodologies.
  • 4.a. Evaluates the workings of the natural and physical world using theories and models that can be tested by experiments and observations.

Corresponding Widener University Institutional Learning Objectives (ILOs)

• ILO 1. Students will demonstrate the knowledge, skills, and scholarship appropriate to their major field of study.
• ILO 2. Students will be able to think critically and communicate effectively.

Policies

ARTIFICIAL INTELLIGENCE (AI) TOOLS POLICY - IMPORTANT!

COPYING FROM THE INTERNET

Attendance Policy

Widener University Attendance Policy will be applied

Academic Fraud

Student Academic Grievance Procedure

If a student has a grievance concerning a class in which he/she is enrolled, he/she will first try to resolve the problem with the instructor of the class. If it is impossible to resolve the matter at this level, then the grievance must be placed in writing and appealed in the following order:
• Division or Program Head
• Dean of Arts and Sciences (Arts and Sciences Academic Council)
• Provost of the University
• University Academic Council
All student grievances will first be referred to the class instructor before they are treated at the level of the Division Head.

Please see Widener's Undergraduate Catalog for:
Standards for Academic Integrity, Appeal Procedures for Student Academic Grievances, and Attendance Policy

Learning Accommodations

Electronic Devices in the Classroom

• NO CELL PHONES. Cell phones must be turned off for the duration of the lecture and lab.
• All electronic devices except cell phones are permitted.

Evaluation Criteria and Policies

• Make-up quizzes, exams and in-class assignments: Any make-up for the mini-quizzes, exams and in-class assignments must be arranged in advance and done IN CLASS.

• The work handed in must be the student's own work.
  Assignments which are written in groups are easily identifies and will receive grades of 0 for all participants.
  For team projects: equal participation of all team members is required.

  Most of the Assignments and Labs will require programming. In this course you would be able to use C, Java or Python programming languages in the UNIX/LINUX or Windows environment.

  In most cases, you will demonstrate the running of your program in class and send a source file by e-mail. The grade for all programming assignments and labs will consist of the following:

  • Correctness of the programming solution and in class demonstration (90%)
  • Programming style, code appearance, and efficiency of the code (10%)

  Good programming style includes well written comments, indentation, meaningful variable and function names, output expalanation, and more. See links below for more details.

  • The Elements of Programming Style, by Brian W. Kernighan and P. J. Plauger from Wikipedia
  • J. Plauger selected quotes from The Elements of Programming Style
  • Programming Style from Wikipedia

  Important

  • Programming assignments must be done individually.
  • The demonstration of the programming solution and the correctness check will be done in class.
  • If you missed the due day class you have to demonstrate the correctness of the program during the course office hours within ONE week of the due day to be qualified for the full credit.
  • If you fail to demonstrate the correctness of the program within ONE week of the due day, each late day will result in reduction of the full credit by 25 points.

  The final grade will consist of the following:

  Final Grade

  Quizzes/Exams	50%
  In Class Labs/In Class Assignments	45%
  Homework and In Class Presentations and Participation	5%
  Total	100%

  Grading System

  Final Grade Table

  A:	95 - 100
  A-:	90 - 94
  B+:	87 - 89
  B:	83 - 86
  B-:	80 - 82
  C+:	77 - 79
  C:	73 - 76
  C-:	70 - 72
  D+:	67 - 69
  D:	60 - 66
  F:	59 - 0