ICS
ICS 180 Sp04 Syllabus

# ICS 180 Sp04 Syllabus - ICS 180 Spring'04 Lecture...

• Notes
• davidvictor
• 5

This preview shows pages 1–3. Sign up to view the full content.

ICS 180, Spring'04 Lecture Summaries, Homeworks, Solutions, Handouts No textbook [+ a tentative schedule for what's to come] [back to course main page] , [shortcut to handout list] [Lecture 1, week 1, 4/6/04] Introduction (lect1.pdf) Overview of goals of cryptography. Shannon's definition of secrecy. Classic ciphers and their insecurity . One-time pad encryption: Its security and, unfortunately, it’s impracticality. Hence, the need for computational notions of hardness. [Lecture 2, week 1, 4/8/04] Computational Notion of Hardness (+ short review of complexity) (lect2.pdf) Probabilistic algorithms, asymptotic analysis of algorithm running time, polynomial time vs. exponential time, notions of negligible adversarial advantage and of computational hardness. Example: Indistinguishability of Private-Key Encryption. Homework 1 (due Thursday, 4/15/04): (hmw1.pdf) Solutions to Homework 1: (sol1.pdf) [Lecture 3, week 2, 4/13/04] Computational Notion of Hardness (cont): One-way encryption and RSA example (lect3.pdf) We define the notion of one-way secure encryption. We use RSA encryption as an example to illustrate how efficiency/hardness of known attacks on RSA is captured by computational notion of security involving the notion of efficient algorithms and negligible probability. [Lecture 4, week 2, 4/15/04] One-way encryption vs. Indistinguishable encryption. (lect4.pdf) We compare the two computational notions of security for encryption. We show that no deterministic cipher, including the textbook RSA can be indistinguishable. We show other ways in which encryption which is assumed one-way secure can still have security flaws, e.g. it can leak some specific plaintexts, some specific bits of every plaintext, etc. This shows the gap between one-way security and indistinguishability for encryption, and motivates finding encryption schemes which satisfy the latter, stronger notion.

This preview has intentionally blurred sections. Sign up to view the full version.

* Two Handouts: Number theory facts, collected by prof. Dan Boneh from Stanford: (h1- primes.pdf) , (h2-composites.pdf) Homework 2 (due Thursday, 4/22/04): (hmw2.pdf) Solutions to Homework 2: (sol2.pdf) [Lectures 5-6, week 3, 4/20-22/04] One-Way Functions, Permutations, and Trapdoor Permutations: Discrete Log, RSA One Way Functions are a fundamental concept for cryptography. These are functions which are easy to compute but hard to invert. We define a One Way Function (Collection) [OWF], and we show that the long-standing number theoretical assumption of hardness of computing discrete logarithms gives rise to a OWF collection and a One-Way Permutation collection [OWP]. To do that, we review some basic modular arithmetic for primes from handout h1-primes.pdf
This is the end of the preview. Sign up to access the rest of the document.
• Spring '04
• Jarecki
• Cryptography, Encryption, public-key encryption, Yevgeni Dodis

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern