Encryption on the Internet Eirik Albrigtsen. Encryption & Decryption Text Unreadable Text key + encryption method Unreadable Text Text key + decryption.

Slides:

Advertisements

Similar presentations

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.

Advertisements

Cryptology Terminology and Early History. Cryptology Terms Cryptology –The science of concealing the meaning of messages and the discovery of the meaning.

CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.

Public Key Encryption Algorithm

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.

COMP 170 L2 Page 1 Part 2 of Course Chapter 2 of Textbook.

Classic Cryptography: Caesar Wenyuan Xu Department of Computer Science and Engineering University of South Carolina 2008.

CPSC CPSC 3730 Cryptography Chapter 2 Classical Encryption Techniques.

Expert System for Analyzing Simple Ciphers: Properties of Cipher Texts Carolyn Rucci Advisor: Ralph Morelli 1 year project.

Public-Key Cryptography and RSA CSE 651: Introduction to Network Security.

Chapter 2 – Classical Encryption Techniques

David Froot.  How do we transmit information and data, especially over the internet, in a way that is secure and unreadable by anyone but the sender.

CSE 504 Discrete Mathematics & Foundations of Computer Science

MAT 1000 Mathematics in Today's World Winter 2015.

CS110: Computers and the Internet Encryption and Certificates.

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.

Computer Security coursework 2 Dr Alexei Vernitski.

Cryptography Data communications and networks Momina Tariq: Ambreen Sohail: Data Communications and Networks.

1 Chapter 2-1 Conventional Encryption Message Confidentiality.

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

Bit Cipher 1. Example of bit Cipher 2 Practical Stream Cipher 3.

Chapter The Integers and Division Division

Symmetric-Key Cryptography

Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.

Cryptography Lynn Ackler Southern Oregon University.

Cryptography Part 1: Classical Ciphers Jerzy Wojdyło May 4, 2001.

© G. Dhillon, IS Department Virginia Commonwealth University Principles of IS Security Cryptography and Technical IS Security.

Cryptograpy By Roya Furmuly W C I H D F O P S L 7.

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

CSCI 391: Practical Cryptology Substitution Monoalphabetic Ciphers.

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

MAT 1000 Mathematics in Today's World Winter 2015.

Encryption CS110: Computer Science and the Internet.

Unit 2 Modular Arithmetic and Cryptography IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 2 Modular Arithmetic and Cryptography.

Vigenére Cipher Kimberly Chiffens & Maria Jannelli.

Introduction to Cryptology Fall Definitions Digital encryption techniques are used to protect data in two ways: to maintain privacy and to prove.

ROT13 cipher. The ROT13 cipher is a substitution cipher with a specific key where the letters of the alphabet are offset 13 places. Example: all 'A's.

Introduction to Cryptography Lecture 4. Caesar Cipher Gaius Julius Caesar (100 B.C.- 44 B.C.) General Politician Dictator of Rome Creator of Caesar Cipher.

Assignment 1 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.

Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.

Information and Computer Security CPIS 312 Lab 1

LAB#3 CLASSICAL ENCRYPTION CPIT 425. This diagram is taken from Dr.Omaima slides.

CMSC 414 Computer (and Network) Security Lecture 3 Jonathan Katz.

Practical Questions Theoretical Questions

Asad Gondal Ali Haider Mansoor

Teaching with Python Lukasz Ziarek SUNY Buffalo

SUBSTITUTION CIPHERS A substitution technique is one in which the letters/number/symbols of plain text are replaced by other letters/numbers/symbols.

Synchronizing Text & Objects

Five-minute starter task

A1 Student Posters Posters Print Services  Robinson Library  University of Newcastle  phone: Introduction The.

<ELLIIT Project Name>

Encryption on the Internet

Poster Title Heading Heading Heading Heading Heading Heading

2016 REPORTING The quick brown fox jumps over the lazy dog. The quick brown fox jumps over the lazy dog. The quick brown fox jumps over the lazy dog.

Definición y tipos discriminación

Fun with Cryptography The Science of Secrecy.

A0 PowerPoint Poster Posters at Print Services Robinson Library, Newcastle University • • phone Introduction.

Digital Communications

A1 Student Posters Posters at Print Services  Robinson Library  University of Newcastle  phone: Introduction.

Introduction to Cryptography I

T A R S E L I T L I S S T O TEMPLATE – SUBTITLE

目录 The quick brown fox. 目录 The quick brown fox.

Homophonic Substitution Cipher

KEYBOARDING: SPEED & ACCURACY

Presentation transcript:

Encryption on the Internet Eirik Albrigtsen

Encryption & Decryption Text Unreadable Text key + encryption method Unreadable Text Text key + decryption method

Caesar’s cipher

Modular Arithmetic 18 = 6 mod = 3 mod = 2 mod 12, as 26 and 2 are 2*12 apart General mathematical statement: a = b mod N  a and b are a multiple of N apart

Caesar’s cipher A=0, B=1, C=2,..., Y=24, Z=25. To encrypt x: E(x) = x+3 mod 26 Example: C = 2, E(2) = 2+3 mod 26 = 5 = F Y=24, E(24) = 24+3 mod 26 = 27 mod 26 = 1 = B

Caesar’s cipher the quick brown fox jumps over the lazy dog WKH TXLFN EURZQ IRA MXPSV RYHU WKH ODCB GRJ

Security of Caesar’s cipher To decrypt x: D(x) = x-3 mod 26 K=3=shift factor Max 25 possible values of K.

Security of Caesar’s cipher

Vigenere Cipher Keyword K = ADHD = (length 4) Encrypt separately each letter depending on its position in the message. If the position is of the form: 0+4n: shift by 0 1+4n: shift by 3 2+4n: shift by 7 3+4n: shift by 3 Example X = BOB BOB = E(X) = BRI EOB =

security = secrecy security = published and attacked, but not broken.

Trust This