Download presentation
Presentation is loading. Please wait.
1
Introduction to Cryptography
Vipul Goyal Spring 2018 .
2
Today’s Lecture Class structure, grading
Flavor of the material: covered / not covered Background needed Course Website: (Planning around 25 lectures) Waitlist: will clear start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
3
Grading Three homework assignments:
10% each, total 30% Late: 0-24 hour late lose 50% value, more than 24 hour late lose 90% You can collaborate with other students on homework problems However: you must write the solutions on your own Must also list the names of students you collaborated with for each problem Do not collaborate with more than 2 students start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
4
Grading Scribe notes: 20% Each student: 2 lectures
Scribe notes due 3 days after the class Must use LaTex. Template available. Revision due 1 week after the class Upload on website 1 week after the class start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
5
Grading Mid-term (in class): 25% Final (take home): 25%
Extra credits: Class participation Based only on quantity rather than quality of questions! Other misc: Office hours: after class / by Waitlist start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
6
Pre-requisites No background in Cryptography/Security necessary. Following needed: Basic mathematical maturity, e.g., comfortable with ``Definitions'' and ``Proofs'' Basic familiarity with probability Random experiments and Random Variables, Expectation, Union Bound, Conditional Probability Basic familiarity with asymptotic (Big-O) notation, P and NP complexity classes, Turing machines, Circuits. Plus: strong puzzle solving skills. Self-enforced start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
7
Cryptography Life becoming more digital
Crypto: defines the rules of digital world Imagine a society w/o rules Classical motivation: secret communication Code designing / code breaking: at least 2000 years of recorded history start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
8
Cryptography Boom Cryptocurrencies
Digital/electronic banking: proxy for physical banking, need trust in bank/govt Last few years: cryptocurrencies/blockchains Bitcoin, Ethereum, … Failure of security enforced by code One data breach after another Common to all: data stored in clear Need encryption / new type of crypto Haven’t seen: crypto being broken in real world. Why? start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
9
This Course: Modern Cryptography
Focus: rigorous security analysis Foundation of modern crypto Heuristic approaches (last several decades) I can’t break it. Must be secure! Deployed Broken Need provable security start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
10
Modern Cryptography Reduction based security proofs
Algo to break scheme -> Algo to break factoring What does “breaking” mean? Security of the scheme must be defined first 3 steps approach: Define Build Prove start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
11
Will Not Cover Designing symmetric ciphers
AES, SHA-256, … See list of topics on class webpage start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
12
TA Yanzun Huang yanzunh@andrew.cmu.edu
Will hold weekly office hours. Fridays 3-4pm (GHC 4101) start with com schemes. a commitment is like .... binding to com to s; committer puts s; at the end, receiver has no idea but still committer can't change his mind later; unique s commitment schemes provide an electronic equivalent of such a combination safe; in the commitment stage, committer sends blah blah later on opening Example: RSA encryption. to decommitment: just send your private key
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.