Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU.

Slides:



Advertisements
Similar presentations
Computer Science Department
Advertisements

CSE 5392By Dr. Donggang Liu1 CSE 5392 Sensor Network Security Course Introduction.
Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.
Network Security – Part 2 Public Key Cryptography Spring 2007 V.T. Raja, Ph.D., Oregon State University.
CSCE 790: Computer Network Security Chin-Tser Huang University of South Carolina.
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
Overview of Cryptography Anupam Datta CMU Fall A: Foundations of Security and Privacy.
Introduction to Modern Cryptography Instructor: Amos Fiat Strongly based on presentation and class by Benny Chor School of Computer Science Tel- Aviv Univ.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
CSCE790: Security and Privacy for Emerging Ubiquitous Communication system Wenyuan Xu Department of Computer Science and Engineering University of South.
CSCD 330 Network Programming Winter 2012 Lecture 1 - Course Details.
1 CSE 651: Introduction to Network Security Steve Lai Spring 2010.
Spring 2012 MATH 250: Calculus III. Course Topics Review: Parametric Equations and Polar Coordinates Vectors and Three-Dimensional Analytic Geometry.
1 CSE 5351: Introduction to Cryptography Ten H. Lai Spring 2015 MW 3:55-5:15 PM, CL133.
CS 415: Programming Languages Course Introduction Aaron Bloomfield Fall 2005.
Cryptography Lecture 1: Introduction Piotr Faliszewski.
Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.
MATH 310, FALL 2003 (Combinatorial Problem Solving) MoWeFr 1:20 McGregory 214.
CSE 501N Fall ‘09 00: Introduction 27 August 2009 Nick Leidenfrost.
1 COMS 161 Introduction to Computing Title: Course Introduction Date: August 25, 2004 Lecture Number: 1.
Introduction to Information Security J. H. Wang Sep. 15, 2014.
Introduction to Network Security J. H. Wang Feb. 24, 2011.
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (1) Information Security.
Network Security by Behzad Akbari Spring 2012 In the Name of the Most High.
CS 4/585: Cryptography Tom Shrimpton FAB
Cryptography, Authentication and Digital Signatures
OPIM 3801: Principles of Project Management Instructor: Bob Day Associate Professor OPIM Dept.
CSCD 434 Network Security Spring 2014 Lecture 1 Course Overview.
CSCD 330 Network Programming Fall/Winter/Spring 2014 Lecture 1 - Course Details.
Midterm Review Cryptography & Network Security
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Lecture 3.4: Public Key Cryptography IV CS 436/636/736 Spring 2013 Nitesh Saxena.
Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2015 Nitesh Saxena.
B. Prabhakaran1 Multimedia Systems Textbook Any/Most Multimedia Related Books Reference Papers: Appropriate reference papers discussed in class from time.
Feb 11, 2003Mårten Trolin1 Applied Cryptography Main goal –Give some practical experience on cryptographic technics used today. –Show how to use existing.
Modern Cryptographic Topics
Introduction to Information Security J. H. Wang Sep. 10, 2013.
Fall 2014 MATH 250: Calculus III. Course Topics Review: Parametric Equations and Polar Coordinates Vectors and Three-Dimensional Analytic Geometry.
Exam Review for First Half of C430 2 May pm in Huxley 308 Michael Huth 2 May pm in Huxley 308 Michael Huth.
Class 2 Cryptography Refresher CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman
CRYPTOGRAPHY. TOPICS OF SEMINAR Introduction & Related Terms Categories and Aspects of cryptography Model of Network Security Encryption Techniques Public.
Class 4 Asymmetric Cryptography and Trusting Internal Components CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman
15-499Page :Algorithms and Applications Cryptography I – Introduction – Terminology – Some primitives – Some protocols.
Introduction to Information Security J. H. Wang Sep. 18, 2012.
ICOM 5995 (crypto) - Noack Crypto - Administrivia Prontuario - Please time-share and ask questions Info is in my homepage amadeus.uprm.edu/~noack/ Make.
Lecture 5.1: Message Authentication Codes, and Key Distribution
Course web page: ECE 646 Cryptography and Computer Network Security ECE web page  Courses  Course web pages  ECE 646.
CSCD 330 Network Programming Winter 2015 Lecture 1 - Course Details.
Mohammad Alauthman 1/22/20162 This 3-credit first course for computer science & IT majors, which provides students the basic understanding.
Lecture 4.1: Hash Functions, and Message Authentication Codes CS 436/636/736 Spring 2014 Nitesh Saxena.
CSCD 303 Essential Computer Security Lecture 1 - Course Details.
1 CIS 5371 Cryptography 1.Introduction. 2 Prerequisites for this course  Basic Mathematics, in particular Number Theory  Basic Probability Theory 
Analysis of Algorithms: Math Review Richard Kelley, Lecture 2.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
CIT 592 Discrete Math Lecture 1. By way of introduction … Arvind Bhusnurmath There are no bonus points for pronouncing my last name correctly Please call.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
CEN 621 Cryptography and Network Security Spring Term CEN 621 Cryptography and Network Security Spring Term INTERNATIONAL BURCH UNIVERSITY.
Introduction to Information Security
사물네트워크 시스템 보안 - Focused on Advanced Cryptography-
Cryptography and Computer Security for Undergraduates
CAS CS 538 Cryptography.
CSCD 330 Network Programming Spring
CSCD 330 Network Programming Spring
26 July 2011 SC 611 Class 1.
Lecture 4.1: Hash Functions: Introduction
CSCD 330 Network Programming Spring
Introduction to Cryptography
Lecture 4.1: Hash Functions, and Message Authentication Codes
CS 336/536: Computer Network Security Fall 2015 Nitesh Saxena
Presentation transcript:

Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU

Announcement 1 CSE department is launching MS program in Cyber-Security –Beginning Fall 2009 –Details coming up shortly!!

Announcement 2 Seeking participants for a usability study of an authentication mechanism –Shoulder-surfing resistant PIN entry –Online study –Little effort Please talk to me if you are interested; your participation will be appreciated It will be good fun!

Outline Administrative Stuff Introductory Technical Stuff

Some Pointers Course Web Page Instructor: Nitesh Saxena Office: LC228 Phone No: Office Hours: Wednesdays 3-5pm (or by appointment) MyPoly Web Page:

About the Instructor PhD from UC Irvine Research in computer and network security, and applied cryptography

Prerequisites 1.Discrete Mathematics (MA 2312/2322) 2.Design and Analysis of Algorithms (CS603 or CS3414) 3.Data Analysis (MA2212) or equivalent Basically, what you need is: Good mathematical background Knowledge of basic probability theory Knowledge of basic algorithms If you don’t satisfy the prerequisites as such, but are interested, I encourage you to take the course. But, do talk to me.

Why Take this Course Cryptography is HOT If you are “theory-inclined”, it’s an interesting course to take If you work in the general area of security, it’s an important course to take According to the MS/PhD course curriculum, you are required to take at least 2 courses from the THEORY area, of which this this course is one. –Theory Core Area for MS CS 6003 Foundations of Computer Science CS 6033 Design and Analysis of Algorithms I CS 6043 Design and Analysis of Algorithms II CS 6753 Theory of Computation CS 6903 Modern Cryptography CS 9173 Computational Geometry

What to Expect The course would be theoretical –With theorems and proofs –No programming whatsoever We will have few homeworks We will have a project based on a relevant topic in cryptography –I can suggest some projects –You are also free to choose your own project, after discussion with me There will be no exam; no programming Grading –60% homeworks –30% project (plus a class presentation of the project) –10% notes scribing (in latex) I might/will make mistakes –Please point them out –Talk to me if you have any issues (or send me an anonymous ☺ ) I guarantee that –you’ll have fun and you’ll learn –you won’t become experts, but you will learn enough to move on! –you’ll hopefully get motivated to pursue research in this area, ultimately

What are my expectations of you Attend lectures Take notes; ask questions Review your notes and the scribe right after the lecture; refer to relevant references Use my office hrs to clear your doubts and for any help I’ll try to review last lecture at the beginning of every lecture –Ask questions then Turn your homeworks on time; no collaboration Be prompt in choosing your project topic –You must work in teams of two each

Lecture Scribing Teams of two each Latex I’ll give you last time’s lecture scribes –Update it in your own words based on current lectures Volunteer for today?

Other Security Courses at Poly Computer Security CS 392/6813 Network Security CS 6823 Other specialized courses

Course References Free online lecture material developed by well- known cryptographers: Book: Introduction to Modern Cryptography: Principles and Protocols (Chapman & Hall/Crc Cryptography and Network Security Series) - Chapman-Network-Security/dp/ / Chapman-Network-Security/dp/ / The online book on applied cryptography might be useful: Other links to be provided as we proceed Bookmark these links today!

Grading 60% - Homeworks (probably 4-6 in #) 30% - Project (and a presentation) 10% - Notes scribing (in latex)

What is Cryptography Etymologically: secret (crypt) writing (graphy) Study of mathematical techniques to achieve various goals in information security, such as confidentiality, integrity, availability, non-repudiation, etc (we cover these today!) Not the only (and not a sufficient) means of providing information security, rather a subset of techniques Quite an old field! A cryptographer designs the code, a cryptanalyst tries to break it Philosophically, cryptography is a contest between the cryptographer and the cryptanalyst!

What is the course about Study of modern cryptography from a theoretical perspective Study of cryptographic primitives that are the building-blocks of various cryptographic applications “provable security” concept; formal analysis

How we would proceed in the course Study a cryptographic primitive (such as encryption) Study its security notions –What it means for a cryptographic primitive to be secure (for example, what it means for an encryption scheme to be secure) –What is the adversarial model Study its various constructions (such as symmetric key encryption DES, public key encryption RSA) Formally anlayze the security of a particular construction based on a particular security notion –Theorem-Proofs (provable security) [Time permitting] Study how to combine various crypto primitives for a cryptographic application/protocol

CS 6903 vs. CS 392/6813 Study a cryptographic primitive (such as encryption) Study its security notions –What it means for a cryptographic primitive to be secure (for example, what it means for an encryption scheme to be secure) –What is the adversarial model Study its various constructions (such as symmetric key encryption DES, public key encryption RSA) Formally anlayze the security of a particular construction based on a particular security notion –Theorem-Proofs (provable security)

Tentative Course Schedule Symmetric encryption (block ciphers) Pseudo-random functions Hash functions and random oracles Message authentication code Number Theory Asymmetric encryption Digital signatures [Protocols for authenticated key exchange]

Some Basic Goals in Information Security Confidentiality Authentication Integrity Non-repudiation Cryptography can be used to achieve these goals –Let’s see how and warm up a little bit!! –Please take notes

Today’s Reading Section of the textbook for the logic of provable security and reduction