Final Exam Review Exam time is Aug. 2 nd 2:00pm – 3:50pm in the same classroom. All semester’s content will be tested, but more on content after midterm.

Slides:

Advertisements

Similar presentations

Computer Security Set of slides 4 Dr Alexei Vernitski.

Advertisements

T T Some Fancy Technology (3 ECTS) Introduction See notes for comments.

Internet and Intranet Protocols and Applications Lecture 9a: Secure Sockets Layer (SSL) March, 2004 Arthur Goldberg Computer Science Department New York.

1 Counter-measures Threat Monitoring Cryptography as a security tool Encryption Digital Signature Key distribution.

 Public key (asymmetric) cryptography o Modular exponentiation for encryption/decryption  Efficient algorithms for this o Attacker needs to factor large.

Lesson Title: Introduction to Cryptography Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Chapters 8 Network Security Professor Rick Han University of Colorado at Boulder

Introduction to Modern Cryptography Instructor: Amos Fiat Strongly based on presentation and class by Benny Chor School of Computer Science Tel- Aviv Univ.

8: Network Security8-1 Chapter 8 Network Security A note on the use of these ppt slides: We’re making these slides freely available to all (faculty, students,

TCP/IP Protocol Suite 1 Chapter 28 Upon completion you will be able to: Security Differentiate between two categories of cryptography schemes Understand.

Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.

8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.

Network Security. Contents Security Requirements and Attacks Confidentiality with Conventional Encryption Message Authentication and Hash Functions Public-Key.

Codes, Ciphers, and Cryptography-RSA Encryption

Announcement Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed. 1.

Chapter 31 Network Security

Network Security. An Introduction to Cryptography The encryption model (for a symmetric-key cipher).

8-1Network Security Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography 8.3 Message integrity, authentication.

 This Class  Chapter 8. 2 What is network security?  Confidentiality  only sender, intended receiver should “understand” message contents.

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (1) Information Security.

Behzad Akbari Spring 2012 (These slides are based on lecture slides by Lawrie Brown)

Midterm Exam Review Release questions via webcourse “assignment” around 10:30am, Thur. Oct. 20 th, due via webcourse at 10:30am next day Submit format:

Midterm Exam #2 Review Exam time is July 5th during class time. The second homework and lecture content after first mid-exam until this class will be covered.

Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15.

Midterm Review Cryptography & Network Security

CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.

Chapter 8, slide: 1 ECE/CS 372 – introduction to computer networks Lecture 18 Announcements: r Final exam will take place August 13 th,2012 r HW4 and Lab5.

Basic Cryptography 1. What is cryptography? Cryptography is a mathematical method of protecting information –Cryptography is part of, but not equal to,

Final Review. The exam Two double-sided letter size cheating sheets allowed Closed book, closed note McMaster calculator allowed Types of questions: –

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

Exam Format  130 Total Points  10 Points Short Answer  15 Points Fill in the Blank  25 Points T/F  60 Points Multiple Choice  20 Points Matching.

23-1 Last time □ P2P □ Security ♦ Intro ♦ Principles of cryptography.

ICT 6621 : Advanced NetworkingKhaled Mahbub, IICT, BUET, 2008 Lecture 11 Network Security (1)

Network Security7-1 CIS3360: Chapter 8: Cryptography Application of Public Cryptography Cliff Zou Spring 2012 TexPoint fonts used in EMF. Read the TexPoint.

Chapter 7: Cryptographic Systems

Privacy versus Authentication Confidentiality (Privacy) –Interceptors cannot read messages Authentication: proving the sender’s identity –The Problem of.

Upper OSI Layers Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.

Cryptography Fundamentals

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

TCP/IP Protocol Suite 1 Chapter 30 Security Credit: most slides from Forouzan, TCP/IP protocol suit.

14-1 Last time Internet Application Security and Privacy Basics of cryptography Symmetric-key encryption.

Network Security7-1 Today r Reminders m Ch6 Homework due Wed Nov 12 m 2 nd exams have been corrected; contact me to see them r Start Chapter 7 (Security)

Midterm Exam #1 Review Exam time is Jun. 12 during class time. The first homework will be fully covered. Necessary formulas will be provided in the exam.

Computer and Network Security - Message Digests, Kerberos, PKI –

CS470 Computer Networking Protocols

Network Security7-1 Chapter 8: Network Security Chapter goals: r Understand principles of network security: m cryptography and its many uses beyond “confidentiality”

CompSci 314 S2 C Modern Data Communications Revision of lectures #2 to #11 Clark Thomborson 12 August 2010.

1 Cryptography Troy Latchman Byungchil Kim. 2 Fundamentals We know that the medium we use to transmit data is insecure, e.g. can be sniffed. We know that.

11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.

 Last Class  Chapter 7 on Data Presentation Formatting and Compression  This Class  Chapter 8.1. and 8.2.

Midterm Review. Chapter 1 Internet Concepts Applications, End-hosts, Routers, Switches, Communication Links Overall architecture How they are organized.

Part 1  Cryptography 1 Integrity Part 1  Cryptography 2 Data Integrity  Integrity  detect unauthorized writing (i.e., modification of data)  Example:

Midterm Exam Review –Time: Oct. 16 (Thursday, in class, close book) –Knowledge questions –True or false statement (explain why) –Protocols –Calculations.

Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim

Midterm Exam Review Release questions via webcourse “assignment” around 12:00pm, Mon. Oct. 28 th, due via webcourse at 12:00pm next day Submit format:

Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke1 Database architecture and security Workshop 4.

8-1 Chapter 8 Security Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.

Final Exam Review Release questions via webcourse “assignment” around 10am, 04/23 (next Monday), due via webcourse at 6pm, next day (next Tuesday) Submit.

Midterm Exam Review Release questions via webcourse “assignment” around 1:30pm, Thur. Oct. 14th, due via webcourse at 11:59pm Submit format: Word file,

Midterm Exam #2 Review Exam time is Mar. 28th during class time.

Basic Network Encryption

Midterm Exam #1 Review Exam time is Feb. 14th during class time.

Final Exam Review Exam time is Aug. 2nd 2:00pm – 3:50pm in the same classroom. All semester’s content will be tested, but more on content after midterm.

Lecture 10: Network Security.

Basic Network Encryption

Cryptography Fundamentals

Midterm Exam Review Time: Knowledge questions

Midterm Exam Review Release questions via webcourse “assignment” around 10:30am, Thur. Oct. 25th, due via webcourse at 10:30am next day Submit format:

Final Exam Review Exam time is May. 2nd 1:00pm – 3:50pm in the same classroom. All semester’s content will be tested, but more on content after midterm.

Presentation transcript:

Final Exam Review Exam time is Aug. 2 nd 2:00pm – 3:50pm in the same classroom. All semester’s content will be tested, but more on content after midterm exam #2. What actually covered in the final exam: –All questions in the 4 homework assignments. –Questions/examples in previous two midterm review slides –Questions/examples in this review slides.

You need to compute out the final numerical results in your answer. Do not simply write down the formula as your answer. –You can bring a calculator (no computer, iPhone, etc) –The numbers in exam are easy to comput

Question Types –Knowledge questions –True or false statement If false, explain why and give the correct statement –Protocols –Calculations

Knowledge Question Examples What are the two classes of cryptography? Which one is similar to shuffling poker card: Substitution cipher or transposition cipher? DES has fixed-size key while AES has options to choose several different sizes of key. Why currently people use 3DES instead of DES? What are the pros and cons for symmetric key crypto? Public key crypto? –Two points: computation cost; key predistribution challenge What is the major difference between HTTP 1.0 and 1.1? Why 1.1 makes such change?

Knowledge Question Examples What are the two major hash functions in use? –SHA-1 and MD5 Using the notation in ch31.ppt, what are the meaning of: –H(m), K A - (H(m)), K CA - (K A + ), K AB (m) Full name of SMTP, FTP, RR, TLD? What are the four types of DNS resource record? Service port for DNS, SMTP, HTTP, SSH, Telnet. SMTP basic commands for compositing

Calculation Problem Examples Compute ciphertext using Cesar cipher Compute ciphertext given transposition cipher key (ch30.ppt, P16-18) If Alice wants to send a message m to Bob confidentially and wants Bob be sure that it is from Alice, what message format should be? Assume Alice and Bob knows each other’s public key beforehand. What if only integrity is required? DNS setup and RRs for a new company (HW4)

Excluding Contents Packet fragmentation SNR and dB concepts and computation Shannon and Nyquist theories Stop-Wait ARQ and go-back-N ARQ CRC computation Checksum computation