CSCI920 (Week 13) Revision (II) Guilin Wang SCSSE Nov. 2010.

Slides:



Advertisements
Similar presentations
Introduction to Computer- Based Information Systems Summer 2005 (CRN 50291), MW 7: :25, CS100 Instructor: Jack G. Zheng Course Introduction June.
Advertisements

Introduction to Dual Eligible Integration National Senior Citizens Law Center and Families USA Webinar July 13, 2011.
Quantum Computing : Security Implications Robert M. Slade, MSc, CISSP
Public Key Cryptosystem
Samuel J. Lomonaco, Jr. Dept. of Comp. Sci. & Electrical Engineering University of Maryland Baltimore County Baltimore, MD 21250
CS 332: Algorithms NP Completeness David Luebke /2/2017.
Logistics HW due next week Midterm also next week on Tuesday
Make sure you know the day and time of the final exam for this section of Math 110: Day: ______ Date:______ Time: ______ to _______ All Math 110.
Strategies to Make Your Reading Time More Effective and Efficient
Suggested Course Outline Cloud Computing Bahga & Madisetti, © 2014Book website:
CS211 Problems: unsolvable, unfeasible and unsolved Topic 3: P and NP.
Management and Mining of Spatio-Temporal Data Rui Zhang The University of Melbourne.
CSCI920 Grand Challenges in Computer Science Guilin Wang SCSSE August 2010.
“ Add your company slogan ” Feasibility Study & Analysis Prepared by : Genoveva
Work Integrated Learning ACDICT Learning and Teaching Network Forum, July 2010 Professor Chris Pilgrim Deputy Dean, Faculty of Information and Communication.
COSC1078 Introduction to Information Technology Lecture 2 Overview
1 P, NP, and NP-Complete Dr. Ying Lu RAIK 283 Data Structures & Algorithms.
Problems and Their Classes
LEVEL II, TERM II CSE – 243 MD. MONJUR-UL-HASAN LECTURER DEPT OF CSE, CUET Recursive & Dynamic Programming.
Stream 1 Dr Deborah King Room G42 Richard Berry Building
Capacity Allocation & Congestion Management Network Codes Stakeholder Meeting 3 July 2012 Introduction & Overview \
Cryptanalysis of a Communication-Efficient Three-Party Password Authenticated Key Exchange Protocol Source: Information Sciences in review Presenter: Tsuei-Hung.
Sunday, Dec. 14 (the day before the first day of final exams) TAs Courtney Staycoff and Josh Kressmer will be on duty in the open lab (room 203) to answer.
1 Complexity ©D.Moshkovitz Cryptography Where Complexity Finally Comes In Handy…
-0- Individual Research – Suh, Il-Seok EVR presentation EVR # Suh, Il-Seok December 6, 2005.
IPM Exam PreparationIPM Exam Preparation November 12 th pm – 5.15pm 2 hours & 15 minutes reading time.
International Operations Management
CSE332: Data Abstractions Lecture 27: A Few Words on NP Dan Grossman Spring 2010.
March 11, 2015CS21 Lecture 271 CS21 Decidability and Tractability Lecture 27 March 11, 2015.
Overview of Cryptography Anupam Datta CMU Fall A: Foundations of Security and Privacy.
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.
Introduction to Computer and Network Security Iliano Cervesato 26 August 2008 – Modern Cryptography.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
Lecture 5 Overview Does DES Work? Differential Cryptanalysis Idea – Use two plaintext that barely differ – Study the difference in the corresponding.
Advanced Research Methodology
Lecture 19 Page 1 CS 111 Online Security for Operating Systems: Cryptography, Authentication, and Protecting OS Resources CS 111 On-Line MS Program Operating.
Dominique Unruh 3 September 2012 Quantum Cryptography Dominique Unruh.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Quantum Algorithms for Neural Networks Daniel Shumow.
Introduction to the Theory of Computation
Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU.
CSCD 434 Network Security Spring 2014 Lecture 1 Course Overview.
Limits and Horizon of Computing Post silicon computing.
RESOURCES, TRADE-OFFS, AND LIMITATIONS Group 5 8/27/2014.
NP Complexity By Mussie Araya. What is NP Complexity? Formal Definition: NP is the set of decision problems solvable in polynomial time by a non- deterministic.
After one pivot: HNT= [4 2 3]
Stages 1 and 2 Wednesday, August 4th, Stage 1: Step 5 National and State Standards.
Instructor: Shengyu Zhang 1. Tractable While we have introduced many problems with polynomial-time algorithms… …not all problems enjoy fast computation.
Lecture 8 Overview. Analysis of Algorithms Algorithms – Time Complexity – Space Complexity An algorithm whose time complexity is bounded by a polynomial.
Nawaf M Albadia
Breaking RSA Encryption Nick Manners. History of Cryptography  Used to be strictly in the domain of governments… state secrets.  Particularly important.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
NP ⊆ PCP(n 3, 1) Theory of Computation. NP ⊆ PCP(n 3,1) What is that? NP ⊆ PCP(n 3,1) What is that?
Intro to Computer Algorithms Lecture 21 Phillip G. Bradford Computer Science University of Alabama.
Quantum Computing: An Introduction
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
P & NP.
Exam Hints.
Quantum Computing and the Quest for Quantum Computational Supremacy
Richard Anderson Lecture 27 NP Completeness
Lecture 39 CSE 331 Dec 5, 2011.
CS21 Decidability and Tractability
CSCD 434 Network Security Spring 2019 Lecture 1 Course Overview.
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
Richard Anderson Lecture 25 NP Completeness
Algorithms CSCI 235, Spring 2019 Lecture 36 P vs
SWE 632 User Interface Design and Development
Presentation transcript:

CSCI920 (Week 13) Revision (II) Guilin Wang SCSSE Nov. 2010

Contact Info Room: Consultation times (updated): - Mon.: 14-16pm - Wed.: 11-13pm URL:

 Revision Strategies  Exam Tips  P vs NP (One Grand Challenge in CS)  Privacy  Cloud Computing  Quantum Computing Outline

 Each lecture does cover a lot of topics  Try to grasp at least the 5 most important topics discussed in each lecture  Those may involve concepts, methods, mechanisms, models, (dis)advantages etc.  The majority exam questions come from those topics, as they are the main points. Revision Strategies

 30 marks for 10 short questions  10 marks for 1 long question  So, the exam accounts for 40% in your final subject mark.  When you answer a question: Understand the question first Focus your answer on the question Write your answer legible Exam Tips

 What is the P vs NP problem? Informally, this problem asks: For any problem, if a given solution can be efficiently verified can it also be efficiently solved by a computer? Quickly verify an answer  Quickly find the answer? P vs NP: One Grand Challenge in CS:

 A more formal definition -P and NP are two complexity classes of problems -P: All problems that can be solved on a deterministic sequential machine in polynomial time, measured by the size of its input. -NP: All problems whose positive solutions can be verified in polynomial time, or equivalently, whose solution can be found in polynomial time on a non- deterministic machine. -So, is P = NP? Source: Wiki P vs NP: One Grand Challenge in CS:

 NP Complete Problems  Examples of P, NP, NP Complete Problems  Why is P vs NP important?  Other challenges we mentioned in lectures are not examinable. P vs NP: One Grand Challenge in CS:

 What is privacy? A working definition give by Ruth Gavison: Privacy can be defined as the limitation of others’ access to an individual. It has three key elements: Secrecy, Anonymity, and Solitude.  Why is privacy important? Intrinsic good – It is desirable for its own sake. That is, it has value and is of benefit in and of itself. Instrumental good – It has value to support other benefits and rights: Privacy

 What are the implications of ICTs for privacy? Many ICTs threaten and erode privacy – particularly information privacy Information gathering – online & mobile Technologies Data matching, data merging, and data mining  How is privacy protected by the law? In Australia, there is no constitutional ‘right’ to privacy But a patchwork of laws exist to protect privacy Information privacy is now largely protected in Australia by federal and state laws. In particular, the Privacy Act 1988 (Cth), the Privacy Amendment (Private Sector) Act 2000 (Cth). Privacy

Cloud Computing  What is cloud computing? A working definition proposed by NIST5 It has 5 essential characteristics, 3 service models, and 4 deployment models  Cloud computing economics Elasticity: Shifting the Risk Comparing Costs: Should I Move to the Cloud?  10 obstacles and opportunities for cloud computing

Cloud Computing

Quantum Computing  Weaknesses in Classical Cryptography - Private key cryptosystems - Public key cryptosystems  Quantum Computing - Parallelism (due to superposition) - Interference (due to entanglement) - Probability (due to measurement) - BQP: Bounded error, Quantum, Polynomial time.  Applications of Quantum Computing - Shor’s algorithm for breaking RSA - BB84 quantum key exchange protocol

Good Luck!