Computers in Society Encryption. Representing Sensory Experience Some objects correspond to human sensory experience – these representations are created.

Slides:



Advertisements
Similar presentations
The Diffie-Hellman Algorithm
Advertisements

Public Key Cryptography Nick Feamster CS 6262 Spring 2009.
Cryptology Making & Breaking Codes & Ciphers. AJ 1152 Cryptology Cryptography –Science of creating codes or ciphers Cryptanalysis –Science of breaking.

Section 3.8: More Modular Arithmetic and Public-Key Cryptography
What is Elliptic Curve Cryptography?
Public Key Algorithms …….. RAIT M. Chatterjee.
OOP/Java1 Public Key Crytography From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.
CS 280 Data Structures Professor John Peterson. Project Not a work day but I’ll answer questions as long as they keep coming! I’ll try to leave the last.
Caesar Cipher a b c d e f g h I j k l m n o p q r s t u v w x y z b c d e f g h I j k l m n o p q r s t u v w x y z a shift of 1 c d e f g h I j k l m.
Computers in Society Encryption. Shameless Plug Catch the kayak club trip to Glenwood on Saturday. Fun!
Public Key Crytography1 From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Foundations of Network and Computer Security J J ohn Black Lecture #3 Aug 28 th 2009 CSCI 6268/TLEN 5550, Fall 2009.
Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
03 December 2003 Public Key Infrastructure and Authentication Mark Norman DCOCE Oxford University Computing Services.
1 Pertemuan 08 Public Key Cryptography Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.
[[ NET-CENTRIC CAPABILITIES TURBULENCE TECHNICAL OVERVIEW : AUGUST 2007 ]] MATH CAREERS AT NATIONAL SECURITY AGENCY Jill Calhoun May 2010.
Encryption Methods By: Michael A. Scott
C HAPTER 13 Asymmetric Key Cryptography Slides adapted from "Foundations of Security: What Every Programmer Needs To Know" by Neil Daswani, Christoph Kern,
Introduction to Public Key Cryptography
Chapter 12 Cryptography (slides edited by Erin Chambers)
1 Lecture 18: Security issues specific to security key management services –privacy –integrity/authentication –nonrepudiation/plausible deniability.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.
CPS Today’s topics Computer Applications Computer Security Upcoming Operating Systems ( Great Ideas, Chapter 10) Reading Great Ideas, Chapter.
I-4 security.
Dr. Lo’ai Tawalbeh 2007 INCS 741: Cryptography Overview and Basic Concepts Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus -
13-1 Last time Security in Networks Network Security Controls Firewalls Honeypots Intrusion Detection Systems.
Protecting Internet Communications: Encryption  Encryption: Process of transforming plain text or data into cipher text that cannot be read by anyone.
Cryptography, Authentication and Digital Signatures
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Cryptography Dave Feinberg. Suppose I send an from to Who has access to that ? What if I want the.
Online Safety and You!. Introduction The good and the bad about the internet Protecting your Personal Information –Password protection Safety.
Encryption Questions answered in this lecture: How does encryption provide privacy? How does encryption provide authentication? What is public key encryption?
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
Chapter 8 – Network Security Two main topics Cryptographic algorithms and mechanisms Firewalls Chapter may be hard to understand if you don’t have some.
Network Security – Special Topic on Skype Security.
Introduction to Quantum Key Distribution
Encryption No. 1  Seattle Pacific University Encryption: Protecting Your Data While in Transit Kevin Bolding Electrical Engineering Seattle Pacific University.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Lecture 2: Introduction to Cryptography
1 Normal executable Infected executable Sequence of program instructions Entry Original program Entry Jump Replication and payload Viruses.
Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.
Overview of Cryptography & Its Applications
Códigos y Criptografía Francisco Rodríguez Henríquez Códigos y Criptografía Francisco Rodríguez Henríquez CINVESTAV
Authentication. Goal: Bob wants Alice to “prove” her identity to him Protocol ap1.0: Alice says “I am Alice” Failure scenario?? “I am Alice”
CRYPTOGRAPHY. WHAT IS PUBLIC-KEY ENCRYPTION? Encryption is the key to information security The main idea- by using only public information, a sender can.
Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.
Encryption. Introduction The incredible growth of the Internet has excited businesses and consumers alike with its promise of changing the way we live.
14-1 Last time Internet Application Security and Privacy Basics of cryptography Symmetric-key encryption.
Encryption Basics Module 7 Section 2. History of Encryption Secret - NSA National Security Agency –has powerful computers - break codes –monitors all.
Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.
Week 4 - Wednesday.  What did we talk about last time?  Finished DES  AES.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.
INCS 741: Cryptography Overview and Basic Concepts.
Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim
Digital Signatures.
Cryptography & Security
Cryptography.
Public Key Cryptography
Public Key Cryptography
Security through Encryption
Appendix 5: Cryptography p
CS 115: COMPUTING FOR The Socio-Techno Web
NET 311 Information Security
Chapter 8 roadmap 8.1 What is network security?
Presentation transcript:

Computers in Society Encryption

Representing Sensory Experience Some objects correspond to human sensory experience – these representations are created to all these experiences to be replicated. This ALWAYS involves the conversion from analog (continuous time and value) to digital (discrete time and value)

From Analog to Digital Media is recorded by turning an analog signal in the real world into a digital signal in a computer. The sampled signal is on a grid: the X direction determines the sampling interval (rate), the Y direction the sampling values. The precision of the sampling determines how closely the digitized signal matches the original.

Approximating Sensation When representing pictures, sounds, or movies there is always a trade-off between size and precision. For example, sound can be represented as.wav or.mp3; pictures as.bmp or.jpg Media formats such as mp3 and jpg degrade the media quality, usually in ways that are not detectable to human senses.

The Next Level So far, we've ignored "meaning". That is, a picture is just a bunch of pixels A sound is just a waveform A book is just a string of characters The hard problem is assigning a deeper meaning to these objects. Go to the seminar of Friday for a good look at this problem!

Ontology Why is ontology important? How do Ontologies relate to object-oriented programming? What is a partition? What are some common relationships? What is the difference between a domain ontology and upper ontology? What is OWL? Why is it important?

Privacy and Security Encryption Anonymity Trust

Encryption The problem: private communication on public channels Is the Internet a public or private channel? Why?

History of Encryption This is a classic example of a problem that has been around for thousands of years that can be addressed directly by computation! Two basic ideas: a computational mechanism to perform encryption and a shared secret between the parties

Encryption Our basic encryption scenario: Alice and Bob are trying to communicate A third party, Trudy, is trying to understand what Bob and Alice are saying. Any message from Alice to Bob is also seen by Trudy

Shared Secret Encryption Until recently, all encryption has been based on a “shared secret”. The classic example is the “One Time Pad” – a sequence of random 0’s and 1’s. Use a key (the pad) to scramble every bit in a message (1 = change, 0 = don’t change) Receiver must have same pad Pad has to be “truly random” Can only use pad once! Code is mathematically unbreakable Pad must have the same length as the message

Using “Keys” The problem with a one time pad is that it gets used up. Instead of a pad, we would rather use a “key”. A key is a piece of information (0’s and 1’s) that is reused continuously to encrypt an arbitrary amount of data Keys are measured by their length (128 bit encryption, for example) Note that “cracking” the key opens up lots of potential information. How hard is it to guess an N-bit key?

Encryption Standards There are many “standard” encryption algorithms (DES, AES, …). We generally rely on public standards rather than private ones – why??? Shared key (symmetric) encryption is computationally efficient – encrypting a long message is no problem at all.

Public Key Encryption This is somewhat like the “invention of the wheel” in the crypto world. A truly world-changing feat that is not much recognized by the public. This was first published publicly by Whitfield Diffie and Martin Hellman in 1976 Malcolm J. Williamson actually developed this stuff first but it was not published

Public Key Encryption Basic idea: you need two keys, a public key that everyone knows and a private key only you know. Sender uses public key of receiver to encode message Only receiver has private key. No need to trust the sender with your secret!

The Lockbox I want to be able to receive something from a friend without worrying about anybody peeking in. My solution: use an unbreakable lockbox with a lock that can't be picked. I'll give my friend the lockbox and one key, I'll keep the other key. He can mail me the locked box and only I can open it. What sort of encryption is this?

The Key Problem I don't want to meet my friend in private to hand him the key but I can't mail him the key either (why?). So what if instead I put a diagram of the key on my website so he can build it himself? Will that work?

Locks Since anyone can build a key, anyone can pick locks on my private message. Instead of keys, let's talk about locks. Think of a combination lock – if it's open, you can lock something with it even if you don't know the combination. You only need the combination to unlock! Now instead of sharing keys, I give an unlocked lock to my friend.

Building Locks Instead of telling everyone in the world how to build my key, I'll tell everyone how to build an open lock than only I can unlock. Wouldn't seeing the plans for this lock make it possible for others to deduce the combination?