1 Simple and Unbreakable: The Mathematics of Internet Security Dr. Monica Nevins Department of Mathematics and Statistics University of Ottawa University.

Slides:

Advertisements

Similar presentations

RSA COSC 201 ST. MARY’S COLLEGE OF MARYLAND FALL 2012 RSA.

Advertisements

Data Security 1 El_Gamal Cryptography. Data Security2 Introduction El_Gamal is a public-key cryptosystem technique El_Gamal is a public-key cryptosystem.

Digital Signatures. Anononymity and the Internet.

Public Key Cryptosystems - RSA Receiver Sender Eavesdroppe r p q p q p q p and q prime.

Data encryption with big prime numbers

22C:19 Discrete Structures Integers and Modular Arithmetic

Section 3.8: More Modular Arithmetic and Public-Key Cryptography

Public Key Encryption Algorithm

What is Elliptic Curve Cryptography?

22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.

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.

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.

Public Key Cryptography

Public Encryption: RSA

RSA Exponentiation cipher

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

CSCI 172/283 Fall 2010 Public Key Cryptography. New paradigm introduced by Diffie and Hellman The mailbox analogy: Bob has a locked mailbox Alice can.

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)

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.

The RSA Algorithm Rocky K. C. Chang, March

Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.

Introduction to Modular Arithmetic and Public Key Cryptography.

MATH 224 – Discrete Mathematics

RSA Implementation. What is Encryption ? Encryption is the transformation of data into a form that is as close to impossible as possible to read without.

T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.

10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.

Section 2.1: Shift Ciphers and Modular Arithmetic The purpose of this section is to learn about modular arithmetic, which is one of the fundamental mathematical.

Systems of Equations as Matrices and Hill Cipher.

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.

Midterm Review Cryptography & Network Security

Tyepmg Pic Gvctxskvetlc April 25, The Caesar Cipher (Suetonius) “If Caesar had anything confidential to say, he wrote it in cipher, that is,

Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.

Section 4.4: The RSA Cryptosystem Practice HW Handwritten and Maple Exercises p at end of class notes.

Darci Miyashiro Math 480 April 29, 2013

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

Modern Cryptographic Topics

What is RSA RSA is a system employed to create the encrypted message in which the key used for encryption is different from that used to decrypt. It is.

RSA Prepared by: SITI ZAINAH ADNAN

Cryptography Dave Feinberg. Suppose I send an from to Who has access to that ? What if I want the.

Some Number Theory Modulo Operation: Question: What is 12 mod 9?

1 Security and Cryptography: basic aspects Ortal Arazi College of Engineering Dept. of Electrical & Computer Engineering The University of Tennessee.

CRYPTOGRAPHY. WHAT IS PUBLIC-KEY ENCRYPTION? Encryption is the key to information security The main idea- by using only public information, a sender can.

22C:19 Discrete Structures Integers and Modular Arithmetic Fall 2014 Sukumar Ghosh.

What use are prime numbers? ?. o All the primes, apart from 2, are odd numbers. o 1 is not a prime number. Why? o There are infinitely many prime numbers!

COMP 424 Lecture 04 Advanced Encryption Techniques (DES, AES, RSA)

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

1 Hello World and Welcome to The simple crypt Key=23 {txzr7c x7Cr 7d~zg{r 7tengc Private-key Cryptography.

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.

Encryption on the Internet Jeff Cohen. Keeping Information Secret What information do we want to be secret? –Credit card number –Social security number.

Computer Security Lecture 5 Ch.9 Public-Key Cryptography And RSA Prepared by Dr. Lamiaa Elshenawy.

Great Theoretical Ideas in Computer Science.

Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.

Lecture 3 (Chapter 9) Public-Key Cryptography and RSA Prepared by Dr. Lamiaa M. Elshenawy 1.

Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.

Data encryption with big prime numbers DANIEL FREEMAN, SLU.

RSA Cryptosystem Great Theoretical Ideas In Computer Science S. Rudich V. Adamchik CS Spring 2006 Lecture 8Feb. 09, 2006Carnegie Mellon University.

Breaking Cryptosystems Joshua Langford University of Texas at Tyler Fall 2007 Advisor: Dr. Ramona Ranalli Alger.

Information and Computer Security CPIS 312 Lab 8 1 Asymmetric Key Algorithms RSA Algorithm TRIGUI Mohamed Salim.

Copyright © Zeph Grunschlag, RSA Encryption Zeph Grunschlag.

1 The RSA Algorithm Rocky K. C. Chang February 23, 2007.

Intro to Cryptography ICS 6D Sandy Irani. Cryptography Intro Alice wants to send a message to Bob so that even if Eve can see the transmitted information,

Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim

Digital Signatures.

Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.

Public Key Cryptosystems - RSA

Discrete Math for CS CMPSC 360 LECTURE 14 Last time:

Presentation transcript:

1 Simple and Unbreakable: The Mathematics of Internet Security Dr. Monica Nevins Department of Mathematics and Statistics University of Ottawa University of Ottawa Day, 2007

2 Cryptography ca. 50 BC Example: VENI, VIDI, VICI Becomes: YHQL, YLGL, YLFL Caesar cipher: Shift each letter forward by 3

3 Second World War : Enigma Secret device Secret settings (rotors and plugs) possibilities "Uncrackable" Cracked by mathematicians in early 1940.

4 Today Millions of people need private, secure communication over the internet every day. Everyone has access to every interchange of communication. How can we start secure communications without first having secure communications?

5 A Thought Experiment Say the only secure communication in this room is to lock your message in a box. Anything not in the box can be read or duplicated or stolen. Could you send me a secret message (that I can read but no one else can)?

6 The model for public key cryptography M C C, d …M ! C?? AliceBob Eve d e e

7 We need a one-way function Multiply : 17 x 11 = ?187 Factor : 91 = ? X ?7 x 13 This is a one-way function: Multiplication is easy Factoring is hard

8 How hard is factoring? Say N has 20 digits. To find a factor, you need to search up to:  N ~ 10 digits How many numbers is that? = 10,000,000,000 = 10 billion

9 Idea: Find two large prime numbers p and q. Set N = pq. But: isn't finding primes just as hard as factoring? NO! Check out the AKS algorithm, 2003.

10 But how does this give us a cryptosystem?

11 Modular Arithmetic Doing math "mod 10" means taking the remainder after division by 10 4 x 4 = 16 implies 4 x 4 = 6 mod 10 4 x 4 = 16 implies 4 x 4 = 1 mod 5

12 Multiplication Table, mod 5 x Mysterious patterns, but : easy to calculate.

13 More powerful: exponentiation Consider powers of 4 mod 91: 4 1 = = = = 256 = 74 mod = 1024 = 23 mod 91 …

14 Exponentiation “mod N” is one-way Calculating powers mod N is easy; Calculating roots mod N is hard. Except: it’s easy if you have the secret key:  (N) = (p-1)(q-1) For example: N = 91 = 13 x 7 gives  (N) = 12 x 6 = 72.

15 How the secret key works When e and d satisfy ed = 1 mod  (N), (Example: 5 x 29 = 145 = 1 mod 72) then C = M e mod N if and only if M = C d mod N.

16 RSA Cryptosystem Two primes: p = 7, q = 13. Set N = pq = 91. Choose an e = 5. Public key: (N, e) = (91, 5) Now  = 72 and d = 29, since ed = 5 x 29 = 145 = 1 mod 72. Private key: d = 29.

17 RSA Encryption Get the public key (N,e) = (91,5) Secret message: M = 4 Calculate C = M e mod N: C = 4 5 mod 91 = 1024 mod 91 = 23 mod 91

18 The Cryptogram 23 ??

19 RSA Decryption Given C = 23 and private key d = 29, calculate: C d = mod 91 Since 23 6 = 1 mod 91, = 23 5 = = 4 mod 91 So the secret message was M = 4 !

20 Security of RSA Mathematicians have been studying number theory for ages --- we have confidence that there are no shortcuts. New technologies (quantum computer) Need new cryptosystems built on different mathematical concepts to ensure we stay ahead of technology (elliptic curves, lattice cryptosystems, etc)

21 For more information Come and enjoy undergraduate studies in Pure Mathematics at the University of Ottawa