Mathematical Concepts in Cryptography 355 Brian Tafel, Mark Shippy Raymond Fuller, and Mireya.

Slides:

Advertisements

Similar presentations

Mathematics of Cryptography Part II: Algebraic Structures

Advertisements

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

22C:19 Discrete Structures Integers and Modular Arithmetic

Public Key Encryption Algorithm

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

Advanced Encryption Standard

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.

1 The AES block cipher Niels Ferguson. 2 What is it? Block cipher: encrypts fixed-size blocks. Design by two Belgians. Chosen from 15 entries in a competition.

Attacks on Digital Signature Algorithm: RSA

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

Inner Workings of the German Enigma. History of the Enigma The concept was invented by a German named Albert Scherbius in 1918 Scherbius tried to take.

Announcements: Assignment 2 finalized Assignment 2 finalizedQuestions?Today: Wrap up Hill ciphers Wrap up Hill ciphers One-time pads and LFSR One-time.

Classical Cryptography

Public Encryption: RSA

Cryptography at The University of South Carolina Douglas B. Meade

Introduction to Computer and Network Security Iliano Cervesato 26 August 2008 – Modern Cryptography.

Cryptography Introduction, continued. Sufficient key space principle If an encryption scheme has a key space that is too small, then it will be vulnerable.

Section 2.9 The Hill Cipher; Matrices

An Introduction to Hill Ciphers Using Linear Algebra Brian Worthington University of North Texas MATH /10/2010.

Chapter 2 – Classical Encryption Techniques

3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.

3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.

Cryptography Week-6.

Polyalphabetic Substitution Ciphers. First Steps Towards Complexity  If one alphabet is good, then two alphabets must be better!  By doubling the number.

Cryptanalysis of the Vigenere Cipher Using Signatures and Scrawls To break a Vigenere cipher you need to know the keyword length. – The Kasiski and Friedman.

Section 2.2: Affine Ciphers; More Modular Arithmetic Practice HW (not to hand in) From Barr Textbook p. 80 # 2a, 3e, 3f, 4, 5a, 7, 8 9, 10 (Use affinecipherbreaker.

Security in Computing Cryptography (Introduction) Derived from Greek words: ‘Kruptos’ (hidden) and ‘graphein’ (writing.

MATH 224 – Discrete Mathematics

Diffusion and Confusion Two properties that a good cryptosystem should have: Diffusion: change of one character in the plaintext results in several characters.

Fubswrorjb Teri Schmidt Matt Rose K-12 Outreach Center for Education and Research in Information Assurance and Security, Purdue University.

Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.

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

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.

Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.

Systems of Equations as Matrices and Hill Cipher.

Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.

Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:

Midterm Review Cryptography & Network Security

1 Chapter 2-1 Conventional Encryption Message Confidentiality.

Quantum Cryptography. Cryptography  Art of writing messages so that no one other than intended receiver can read it.  Encryption – Performing mathematical.

National Institute of Science & Technology Cryptology and Its Applications Akshat Mathur [1] Cryptology and Its Applications Presented By AKSHAT MATHUR.

Symmetric-Key Cryptography

Introduction to cryptography by konrad. Introduction to cryptography Cryptography is the process of encrypting/decrypting data streams using some E(M)/D(M)

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

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

Public Key (RSA) Day 27. Objective Students will be able to… …understand how RSA is used for encryption and decryption. …understand some of the challenges.

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

Announcements: Matlab tutorial linked to in syllabus Matlab tutorial linked to in syllabusQuestions?Today: Block ciphers, especially Hill Ciphers Modular.

Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.

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.

Public Key Cryptosystem Introduced in 1976 by Diffie and Hellman [2] In PKC different keys are used for encryption and decryption 1978: First Two Implementations.

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

Introduction to Elliptic Curves CSCI 5857: Encoding and Encryption.

Discrete Mathematical Structures: Theory and Applications 1 Cryptography (advanced extra curricular topic)  Cryptography (from the Greek words Kryptos,

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

RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.

Le Trong Ngoc Security Fundamentals (2) Encryption mechanisms 4/2011.

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

How the internet works Cryptography. LO: Define the terms encryption and decryption Construct a secure message using encryption LO: Define the terms encryption.

Lecture 6. RSA Use in Encryption to encrypt a message M the sender: – obtains public key of recipient PU={e,n} – computes: C = M e mod n, where 0≤M

Prof. Wenguo Wang Network Information Security Prof. Wenguo Wang Tel College of Computer Science QUFU NORMAL UNIVERSITY.

Information Security CPIT 425 Instructor: Bashair Alrashed LAB1.

3.1 Chapter 3 Traditional Symmetric-Key Ciphers Part2.

Substitution Ciphers.

Classical Polygraphic Ciphers

Assignment #1 Solutions

Hill Cipher The Hill Cipher uses matrix multiplication to encrypt a message. First, you need to assign two numbers to each letter in the alphabet and also.

Presentation transcript:

Mathematical Concepts in Cryptography 355 Brian Tafel, Mark Shippy Raymond Fuller, and Mireya

The Hill Cipher uses linear algebra to disguise frequency patterns that occur in natural language. A. In the forward direction or encryption process we use matrix multiplication. B. In the reverse or decryption process we use matrix inversion. C. First, let’s learn a little about linear algebra.

Matrix Multiplication | | | 5 | A = | | | 7 | | | | 3 | 2x + 3y – 4z = 5 -2x + z = 7 3x + 2y + 2z = 3 | 5 | B = | 7 | | 3 | | x | X = | y | | z | Linear system AX = B Linear system in matrix form

Matrix Multiplication | | | 0 | | | | 2 | | | | 19 | | 57 | = | 122 | | 169 | | 15| = |14| MOD 26 | 7 | ( 6)(0) + (24)(2) + ( 1)(19) = 57 (13)(0) + (16)(2) + (10)(19) = 122 (20)(0) + (17)(2) + (15)(19) = 169 ACT A = 0, C = 2, T = 19 Becomes the cipher text POH P = 15, O = 14, H = 7 Key matrix GYBNQKURP = 6,24,1,13,16,10,20,17,15

Matrix Decryption | | | 15 | | | | 14 | | | | 7 | First you take the inverse of the Key matrix, which is too horrible to explain. This gives you IFKVIVVMI = 8,5,10,21,8,21,21,12,8 Using are Encrypted cipher text POH = 15,14,7 | 260 | = | 574 | | 539 | | 0 | = | 2| mod 26 |19| Which gives us are message 0,2,19 or ACT

Use of Determinants | a b | | c d | = a b – c d | a b c | | d e f | | g h j | = a(ej – hf) – b(dj – gf) + c(dh – ge) 2 X 2 Matrix 3 X 3 Matrix If the determinate is zero, or has factors like 2 and 13 then we cannot use Hill Cipher. One variant uses 3 extra symbols to make the modulus 29 (prime).

Mechanical Implementation Hill and a partner were awarded a patent for a 6 x 6 matrix mod 26 machine using gears and chains. Theories such as Hill’s became automated during the Industrial Revolution. In 1927 this led to the Enigma machine.

Drawbacks of Hill cipher The Linearity of the cipher is its downfall. The know Plaintext attack is where the attacker Has samples of both the Plaintext and Encrypted versions. During WWII the Germans would give a weather forecast every day at the same time. The message would contain the word wetter in the same location in every message. Knowing the local weather also helped guess the other parts of the message.

Question ???? The Hill Cipher utilizes What type of complex mathematics?

Answer Linear Algebra