Intro. to Cryptography
COMS 4261
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Introduction to Cryptography: Learning the Science of Secure Communication, Slides of Cryptography and System Security
An introduction to the field of cryptography, covering the basics of cryptography, classical problems, additional problems, security model history, primitives, and what you will learn in a cryptography course. Topics include privacy, authenticity, identity, non-repudiation, coin flipping, and secret sharing. The document also outlines the textbook and collaboration policy for the course.
Typology: Slides
2012/2013
1 / 11
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Introduction to Cryptography: Learning the Science of Secure Communication and more Slides Cryptography and System Security in PDF only on Docsity!
Intro. to Cryptography
COMS 4261
2
Cryptography
cryptography - science of designing secure communication methods
crypt - “secret” in Latin
graphia - “writing” cryptanalysis - science of breaking such methods cryptology = cryptography + cryptanalysis steganograpy - science of hiding communication
4
Additional Problems
Authenticity - B assured that M unchanged Identity - B assured that A wrote M Non-repudiation - A can’t deny writing M Coin flipping - A and B flip coin over phone Secret sharing - A, B can only reveal secret working together Complex protocols - electronic elections, digital cash, secret leaking traceability, etc.
5
Security Model History
I. Originally none - invent cipher and assume secure II. Classically - cryptanalysis driven III. Shannon - defined perfect secrecy IV. Computational - find some computationally intractable problem which reduces to cracking the given crypto protocol
7
What you will learn...
... All of the above Setting: rigorous mathematical approach Pre-requisites:
Must: discrete math
Recommended: computability theory OR algorithm analysis
Helpful: familiarity with number theory, probability, and randomized algorithms
8
What you will NOT
learn...
... won’t come close to reflecting all of crypto ... IPSEC, SSL, SSH, or any other protocol that is used in practice ... architecture specific design, or even the most efficient possible algorithms ... hacking, viruses, trojan-horses, DeCSS, firewalls, or any other computer security Our Advanced Crypto deals with first issue, and our Network Security course addresses much of the last three
10
Grades
5 or 6 homeworks - 50%
Midterm - 20%
Final - 30% Each portion curved
11
Collaboration Policy
On homework
GOOD: study with friends, bounce ideas off each other, solve problems together, then write your own solutions at home from scratch and list all your collaborators on the top of homework
BAD: not listing colaborators OR copying in any way, shape or form any part of the solution from another source On exams - NONE!!!!!