Cryptography Made Easy Stuart Reges Principal Lecturer University of Washington.

Slides:



Advertisements
Similar presentations
the basics cryptography deals with techniques for secure communication in the presence of third parties (adversaries). modern cryptography uses mathematics,
Advertisements

Cryptology Making & Breaking Codes & Ciphers. AJ 1152 Cryptology Cryptography –Science of creating codes or ciphers Cryptanalysis –Science of breaking.
CSE331: Introduction to Networks and Security Lecture 19 Fall 2002.
BY : Darshana Chaturvedi.  INTRODUCTION  RSA ALGORITHM  EXAMPLES  RSA IS EFFECTIVE  FERMAT’S LITTLE THEOREM  EUCLID’S ALGORITHM  REFERENCES.
A Presentation by: ~Ksenia Potapov ~Amariah Condon ~Janette Fong ~Janice Lau CRYPTOGRAPHY.
Modern Cryptography.
OOP/Java1 Public Key Crytography From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.
Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.
CRYPTOGRAPHY Modern techniques. Computers and Cryptography Computers allow more sophisticated enciphering than mechanical devices Computers are faster.
Public Key Crytography1 From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Cryptography Lecture 11: Oct 12. Cryptography AliceBob Cryptography is the study of methods for sending and receiving secret messages. adversary Goal:
Cryptography and Internet Security How mathematics makes it safe to shop on-line John Lindsay Orr University of Nebraska - Lincoln.
1 Lecture #10 Public Key Algorithms HAIT Summer 2005 Shimrit Tzur-David.
Cryptography CS-103 Chapter 8. History Humans have been devising systems to encode information for at least 4000 years.Humans have been devising systems.
Public Encryption: RSA
RSA Encryption William Lu. RSA Background  Basic technique first discovered in 1973 by Clifford Cocks of CESG (part of British GCHQ)  Invented in 1977.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.
Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.
Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.
1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.
Chapter 12 Cryptography (slides edited by Erin Chambers)
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Cryptography Programming Lab
Network and Communications Network Security Department of Computer Science Virginia Commonwealth University.
CS110: Computers and the Internet Encryption and Certificates.
T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.
Encryption Coursepak little bit in chap 10 of reed.
1 Applications of Number Theory CS 202 Epp section 10.4 Aaron Bloomfield.
Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.
An Introduction to Cryptography. What is cryptography? noun \krip- ˈ tä-grə-fē\ : the process of writing or reading secret messages or codes “Encryption”:
Terminology and classical Cryptology
CSCI 5857: Encoding and Encryption
Feb 11, 2003Mårten Trolin1 Applied Cryptography Main goal –Give some practical experience on cryptographic technics used today. –Show how to use existing.
Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.
Cryptography and Network Security Chapter 9 - Public-Key Cryptography
Algebra of RSA codes Yinduo Ma Tong Li. Ron Rivest, Adi Shamir and Leonard Adleman.
1 Simple and Unbreakable: The Mathematics of Internet Security Dr. Monica Nevins Department of Mathematics and Statistics University of Ottawa University.
Multimedia Data Security and Cryptographic Algorithms Dr Sandra I. Woolley Electronic, Electrical.
Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.
PUBLIC-KEY CRYPTOGRAPHY AND RSA – Chapter 9 PUBLIC-KEY CRYPTOGRAPHY AND RSA – Chapter 9 Principles Applications Requirements RSA Algorithm Description.
Encryption CS110: Computer Science and the Internet.
Encryption Basics Module 7 Section 2. History of Encryption Secret - NSA National Security Agency –has powerful computers - break codes –monitors all.
CS Modular Division and RSA1 RSA Public Key Encryption To do RSA we need fast Modular Exponentiation and Primality generation which we have shown.
Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.
CS100A, Lecture 13, 15 October CS100A Lecture Oct Discussion of Prelim 2 (Tuesday, 20 October, 7:30-9PM) Rooms for Prelim 2 A-K: Hollister.
CS 150 – Computing: From Ada to the Web Cryptography.
Chaos, Communication and Consciousness Module PH19510 Lecture 13 Encryption in the Computer Age.
MM Clements Cryptography. Last Week Firewalls A firewall cannot protect against poor server, client or network configuration A firewall cannot.
1 Applications of Number Theory CS/APMA 202 Rosen section 2.6 Aaron Bloomfield.
RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.
RSA Cryptosystem Great Theoretical Ideas In Computer Science S. Rudich V. Adamchik CS Spring 2006 Lecture 8Feb. 09, 2006Carnegie Mellon University.
Brief Incursion into Cryptography 1 20 th May 2008 Brief Incursion into Cryptography 20 th May 2008.
Cryptography By: Nick Belhumeur. Overview What is Cryptography? What is Cryptography? 2 types of cryptosystems 2 types of cryptosystems Example of Encryption.
Cryptography – Test Review
Public-key Cryptography
(Tuesday, 20 October, 7:30-9PM) Encryption-Decryption
Taehyung Kim HPC Lab. POSTECH
Some basic terminology
Modular Arithmetic and RSA Encryption
Encryption NSA – used to be able to crack most codes, technology has changed that Encryption is the art of encoding messages so they can’t be understood.
History of Cryptography
PART VII Security.
Encryption NSA – used to be able to crack most codes, technology has changed that. Now other methods are applied by NSA to access transmissions (see 2013.
MSIT 543 Cryptography Concepts and Techniques How RSA Encryption Works
Encryption NSA – used to be able to crack most codes, technology has changed that Encryption is the art of encoding messages so they can’t be understood.
Modern Cryptography.
Presentation transcript:

Cryptography Made Easy Stuart Reges Principal Lecturer University of Washington

Why Study Cryptography? Secrets are intrinsically interesting So much real-life drama: Mary Queen of Scots executed for treason primary evidence was an encoded letter they tricked the conspirators with a forgery Students enjoy puzzles Real world application of mathematics

Some basic terminology Alice wants to send a secret message to Bob Eve is eavesdropping Cryptographers tell Alice and Bob how to encode their messages Cryptanalysts help Eve to break the code Historic battle between the cryptographers and the cryptanalysts that continues today

Start with an Algorithm The Spartans used a scytale in the fifth century BC (transposition cipher) Card trick Caesar cipher (substitution cipher): ABCDEFGHIJKLMNOPQRSTUVWXYZ GHIJKLMNOPQRSTUVWXYZABCDEF

Then add a secret key Both parties know that the secret word is "victory": ABCDEFGHIJKLMNOPQRSTUVWXYZ VICTORYABDEFGHJKLMNPQSUWXZ "state of the art" for hundreds of years Gave birth to cryptanalysis first in the Muslim world, later in Europe

Cryptographers vs Cryptanalysts A battle that continues today Cryptographers try to devise more clever algorithms and keys Cryptanalysts search for vulnerabilities Early cryptanalysts were linguists: frequency analysis properties of letters

Vigenère Square (polyalphabetic)

Vigenère Cipher More secure than simple substitution Confederate cipher disk shown (replica) Based on a secret keyword or phrase Broken by Charles Babbage

Cipher Machines: Enigma Germans thought it was unbreakable Highly complex plugboard to swap arbitrary letters multiple scrambler disks reflector for symmetry Broken by the British in WW II (Alan Turing)

Public Key Encryption Proposed by Diffie, Hellman, Merkle First big idea: use a function that cannot be reversed (a humpty dumpty function): Alice tells Bob a function to apply using a public key, and Eve can’t compute the inverse Second big idea: use asymmetric keys (sender and receiver use different keys): Alice has a private key to compute the inverse Key benefit: doesn't require the sharing of a secret key

RSA Encryption Named for Ron Rivest, Adi Shamir, and Leonard Adleman Invented in 1977, still the premier approach Based on Fermat's Little Theorem: a p-1  1 (mod p) for prime p, gcd(a, p) = 1 Slight variation: a (p-1)(q-1)  1 (mod pq) for distinct primes p and q, gcd(a,pq) = 1 Requires large primes (100+ digit primes)

Example of RSA Pick two primes p and q, compute n = p  q Pick two numbers e and d, such that: e  d = k(p-1)(q-1) + 1 (for some k) Publish n and e (public key), encode with: (original message) e mod n Keep d, p and q secret (private key), decode with: (encoded message) d mod n

Why does it work? Original message is carried to the e power, then to the d power: (msg e ) d = msg ed Remember how we picked e and d: msg ed = msg k(p-1)(q-1) + 1 Apply some simple algebra: msg ed = (msg (p-1)(q-1) ) k  msg 1 Applying Fermat's Little Theorem: msg ed = (1) k  msg 1 = msg

Politics of Cryptography British actually discovered RSA first but kept it secret Phil Zimmerman tried to bring cryptography to the masses with PGP and ended up being investigated as an arms dealer by the FBI and a grand jury The NSA hires more mathematicians than any other organization

Exploring further Simon Singh, The Code Book RSA Factoring Challenge (unfortunately the prizes have been withdrawn) Shor's algorithm would break RSA if only we had a quantum computer Java's BigInteger: isProbablePrime, nextProbablePrime, modPow Collection of useful links:

Card Trick Solution Given 5 cards, at least 2 will be of the same suit (pigeon hole principle) Pick 2 such cards: one will be hidden, the other will be the first card First card tells you the suit Hide the card that has a rank that is no more than 6 higher than the other (using modular wrap-around of king to ace) Arrange other cards to encode 1 through 6

Encoding 1 through 6 Figure out the low, middle, and high cards rank (ace < 2 < 3... < 10 < jack < queen < king) if ranks are the same, use the name of the suit (clubs < diamonds < hearts < spades) Some rule for the 6 arrangements, as in: 1: low/mid/hi3: mid/low/hi5: hi/low/mid 2: low/hi/mid4: mid/hi/low6: hi/mid/low