Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory Theory of Computation CS3102 – Spring 2014 A tale.

Slides:

Advertisements

Similar presentations

Impagliazzos Worlds in Arithmetic Complexity: A Progress Report Scott Aaronson and Andrew Drucker MIT 100% QUANTUM-FREE TALK (FROM COWS NOT TREATED WITH.

Advertisements

Public Key Cryptography Nick Feamster CS 6262 Spring 2009.

Models of Computation Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 1, Lecture 2.

Theory of Computation CS3102 – Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer.

Lecture 18 Ordinary Annuities Ana Nora Evans 403 Kerchof Math 1140 Financial Mathematics.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Class 25: Security through Complexity? Karsten Nohl cs302: Theory of Computation University of Virginia, Computer Science PS6 is due today. Lorenz cipher.

Theory of Computing Lecture 16 MAS 714 Hartmut Klauck.

CIT 596 Theory of computing Traditional course (CIS 511, CIS 262) and other similarly named courses in other universities are divided into 3 parts that.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Introduction to Algorithms Chapter 7: Quick Sort.

David Evans CS588: Security and Privacy University of Virginia Computer Science Lecture 11: Birthday Paradoxes.

January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.

Lattice-Based Cryptography. Cryptographic Hardness Assumptions Factoring is hard Discrete Log Problem is hard  Diffie-Hellman problem is hard  Decisional.

CSE332: Data Abstractions Lecture 27: A Few Words on NP Dan Grossman Spring 2010.

How to Prepare for the Fall Exam COM380/CIT304 Harry Erwin, PhD University of Sunderland.

Lecture 40 CSE 331 Dec 11, Announcements Solutions to HW 10 and graded HW 9 at end of the lecture Review session on Monday: see blog for details.

Lecture 40 CSE 331 Dec 8, Finals 3:35-6:05pm KNOX 104 Tue, Dec 14 Blog post on the finals up.

P versus NP and Cryptography Wabash College Mathematics and Computer Science Colloquium Nov 16, 2010 Jeff Kinne, Indiana State University (Theoretical)

Public Key Cryptography Topical Lecture Week 10. PUBLIC AB Public Key Cryptography A: Hey B, send me an encoded message. This is how you encode a message.

Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.

CS10 The Beauty and Joy of Computing Lecture #23 : Limits of Computing Thanks to the success of the Kinect, researchers all over the world believe.

A Brief Introduction To The Theory of Computer Science and The PCP Theorem By Dana Moshkovitz Faculty of Mathematics and Computer Science The Weizmann.

Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.

Irene Díaz 1, Camino R. Vela 1 1 Computer Science Department. University of Oviedo (SPAIN) s 1.

If NP languages are hard on the worst-case then it is easy to find their hard instances Danny Gutfreund, Hebrew U. Ronen Shaltiel, Haifa U. Amnon Ta-Shma,

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)

Theory of Computation CS3102 – Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer.

1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL 103.

CS1502 Formal Methods in Computer Science Lecture Notes 16 Review for Exam2 continued Theory of Computation Introduction.

L ECTURE 1 T HEORY OF C OMPUTATION Yasir Imtiaz Khan.

FACULTY OF ENGINEERING & INFORMATION TECHNOLOGIES P, NP, and Complexity Six fundamental facts One rule of thumb Three fundamental notions One fundamental.

Network Security Section 1: Introduction to security.

Problem of the Day: Factor (ab) k as xyz in all ways such that y ≠ ε.

David Evans CS150: Computer Science University of Virginia Computer Science Class 33: Computing with Photons From The.

Introduction to Quantum Key Distribution

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

Lecture 38 CSE 331 Dec 2, Review Sessions etc. Atri: (at least ½ of) class next Friday Jiun-Jie: Extra office hour next Friday Jesse: Review Session.

CS10: The Beauty and Joy of Computing Lecture #22 Limits of Computing Warning sign posted at Stern Hall. Also, Apple releases new operating.

2101INT – Principles of Intelligence Systems Lecture 3.

David Evans CS200: Computer Science University of Virginia Computer Science Lecture 15: Intractable Problems (Smiley.

Complexity © 2014 Project Lead The Way, Inc.Computer Science and Software Engineering.

David Evans Class 15: P vs. NP (Smiley Puzzles and Curing Cancer) CS150: Computer Science University of Virginia Computer.

CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.

Lecture 3.1: Public Key Cryptography I CS 436/636/736 Spring 2012 Nitesh Saxena.

Lecture 38 CSE 331 Dec 5, OHs today (only online 9:30-11)

Lecture 8 Page 1 CS 236 Online Prolog to Lecture 8 CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.

Lecture 20 CSE 331 July 30, Longest path problem Given G, does there exist a simple path of length n-1 ?

Intro to Computer Algorithms Lecture 21 Phillip G. Bradford Computer Science University of Alabama.

CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.

Formal Foundations-II [Theory of Automata]

Course Outline Network Management Bahador Bakhshi

CS154, Lecture 18:.

CRYPTOGRAPHY קריפטוגרפיה Thu 15:45-18:15.

The Journey from NP to TFNP Hardness

Discrete Mathematics CS 2610

ARRAY DIVISION Identity matrix Islamic University of Gaza

Lecture 39 CSE 331 Dec 5, 2011.

CSE 589 Applied Algorithms Spring 1999

Teacher Name Teacher Name Teacher Name Teacher Name Teacher Name

Algorithms CSCI 235, Spring 2019 Lecture 36 P vs

What is Computer Science at Duke?

Week 11 - Wednesday CS221.

Presentation transcript:

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

Only 1 Lecture Left! We will not get to context sensitive grammars, you may skip those problems on the problem set The final exam will be take home (same rules as midterm) Out: noon Friday May 1 st Due: 5pm Friday May 8 th

Impagliazzo’s 5 Worlds Describes what computer science might look like depending on how certain open questions are answered. Algorithmica Heuristica Pessiland Minicrypt Cryptomania

Gauss vs. Büttner Büttner’s goal: embarrass Gauss Come up with a problem which Gauss finds difficult but Büttner can solve quickly For example: 1.Start with some NP problem 2.Pick a witness 3.Find a string for that witness 4.Give the string to Gauss

Algorithmica P=NP (or similar) NP problems solvable efficiently Gauss can quickly find the witness to Buttner’s problem Gauss is not embarrassed Advantages: VLSI Design Strong AI Cure for cancer? Disadvantages: No privacy Turing Test Passable

Heuristica P≠NP in worst case, P=NP on average Time to come up with a problem ≈ time to solve it Büttner can give hard problems, but it’s hard to find them Gauss is not embarrassed Advantages: Maybe similar to Algorithmica Depends on real- world distributions Disadvantages: Bad real world distributions could make things hard to solve

Pessiland P≠NP on average, one-way functions don’t exist Hard problems easy to find, but solved hard problems difficult to find Gauss can be stumped, but teacher does no better Advantages: Universal Compression Reverse Engineering Derandomization Disadvantages: No crypto No algorithmic advantages Progress is slow

Minicrypt One-way functions exist, no public key cryptography Büttner can give hard problems to Gauss and also know their solutions Gauss is embarrassed Advantages: Private key crypto Can prove identity Disadvantages: No electronic currencies

Cryptomania Public Key Crypto Exists Büttner can come up with problems and solutions, then share the solution with all other students Gauss is very embarrassed Advantages: Secure computation Signatures Bitcoin, etc. Disadvantages: Algorithmic progress will be slow