Affine Cipher.

Slides:



Advertisements
Similar presentations
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.
Advertisements

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Cryptology Terminology and Early History. Cryptology Terms Cryptology –The science of concealing the meaning of messages and the discovery of the meaning.
Public Key Encryption Algorithm
Cryptography Cryptography: art or science of keeping messages secret Cryptology: branch of mathematics that studies the mathematical foundations of cryptographic.
CYPHER INDEX n Introduction n Background n Demo INTRODUCTION n Cypher is a software toolkit designed to aid in the decryption of standard (historical)
CPSC CPSC 3730 Cryptography Chapter 2 Classical Encryption Techniques.
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.
An Introduction to Hill Ciphers Using Linear Algebra Brian Worthington University of North Texas MATH /10/2010.
Codes, Ciphers, and Cryptography-RSA Encryption
Introduction to Cryptography
1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.
History and Background Part 1: Basic Concepts and Monoalphabetic Substitution CSCI 5857: Encoding and Encryption.
Classical Monoalphabetic Ciphers Day 2. Keyword cipher Select a keyword, if the keyword has any repeated letters, drop all but the first occurrence. Write.
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.
1st Class Discrete Structures الهياكل المتقطعة أستاذة المادة: م. م
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.
MATH 224 – Discrete Mathematics
CSCI 5857: Encoding and Encryption
MAT 1000 Mathematics in Today's World Winter 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.
Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15.
Rather than just shifting the alphabet Could shuffle (jumble) the letters arbitrarily Each plaintext letter maps to a different random cipher text letter.
30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Symmetric-Key Cryptography
CSCI 5857: Encoding and Encryption
Section 4.4: The RSA Cryptosystem Practice HW Handwritten and Maple Exercises p at end of class notes.
30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
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,
Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.
Section 2.5 Polyaphabetic Substitutions
MAT 1000 Mathematics in Today's World Winter 2015.
Section 2.3: Substitution Ciphers
Vigenère Tableau Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
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.
Lecture 4 DECIPHERING CLASSICAL CIPHER SYSTEMS By: NOOR DHIA AL- SHAKARCHY
Encryption. LEARNING OBJECTIVES: BY THE END OF THE LESSON YOU SHOULD KNOW. What encryption is and why it is important The basics of encryption techniques.
Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.
Dr. Saatchi, Seyed Mohsen 1 Arab Open University - AOU T209 Information and Communication Technologies: People and Interactions Sixth Session.
Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim
Lecture 2 Classical Cipher System SIMPLE SUBSTITUTION CIPHERS By: NOOR DHIA AL- SHAKARCHY
Information Security CPIT 425 Instructor: Bashair Alrashed LAB1.
CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”
Substitution Ciphers.
Modular Arithmetic with Applications to Cryptography
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
Asad Gondal Ali Haider Mansoor
Prepared by: Sameer Ali Aljaroodi, Tutor: Mr. Ahmad Kananh
History and Background Part 4: Transposition Ciphers
Chapters 14,15 Security.
Computer and Data Security 4th Class
CS4780 Cryptography and Information Security
Information and Computer Security CPIS 312 Lab 2
Topics discussed in this section: 30-2 SYMMETRIC-KEY CRYPTOGRAPHY Symmetric-key cryptography started thousands of years ago when people needed.
Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
- Stream Cipher and Block Cipher - Confusion & Diffusion
M3: Encryption r By Andrew Stringer.
Pigpen Cipher A = Q = T = Z = A B C D E F G H I J K L M N O P Q R S T
Pigpen Cipher A = Q = T = Z = A B C D E F G H I J K L M N O P Q R S T
NET 311D Information Security
National Cipher Challenge
Simple Encryption- Lesson 5
Fun with Cryptography The Science of Secrecy.
Chapters 14,15 Security.
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.
Double Transpositions
Symmetric Encryption or conventional / private-key / single-key
Presentation transcript:

Affine Cipher

Group Members Awais Sajid Hassan Javaid Irfan Rasheed Asad Tanveer Toor M. Ramzan Malik Umair

What is Affine Affine Cipher The affine cipher is a type of monoalphabetic substitution cipher, wherein each letter in an alphabet is mapped to its numeric equivalent, encrypted using a simple mathematical function, and converted back to a letter

Monoalphabetic ? A simple example is where each letter is encrypted as the next letter in the alphabet: "a simple message" becomes "B TJNQMF NFTTBHF"

Mathematically The encryption function for a single letter is E(x)=(ax+b)mod{m} where b is the magnitude of the shift.

Mathematically The decryption function is D(x)=a^{-1}(x-b)mod {m} where modulus m is the size of the alphabet and a and b are the key of the cipher

Example In coming two examples, one encrypting and one decrypting, the alphabet is going to be the letters A through Z, and will have the corresponding values found in the following table.

Example

Coprime In mathematics, two integers (a and b) are coprime (or relatively prime) if they share no common factors

Encrypting In this encrypting example,[1] the plaintext to be encrypted is "AFFINE CIPHER" using the table mentioned above for the numeric values of each letter, taking a to be 5, b to be 8, and m to be 26 since there are 26 characters in the alphabet being used.

Encrypting Only the value of a has a restriction since it has to be coprime with 26. The possible values that a could be are 1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, and 25

Encrypting The first step in encrypting the message is to write the numeric values of each letter.

Encrypting Now, take each value of x, and solve the first part of the equation, (5x + 8). After finding the value of (5x + 8) for each character, take the remainder when dividing the result of (5x + 8) by 26. The following table shows the first four steps of the encrypting process.

Encrypting The final step in encrypting the message is to look up each numeric value in the table for the corresponding letters. In this example, the encrypted text would be IHHWVCSWFRCP. The table below shows the completed table for encrypting a message in the Affine cipher.

Decrypting In this decryption example, the ciphertext that will be decrypted is the ciphertext from the encryption example. The corresponding decryption function is D(y) = 21(y − 8) mod 26, where a−1 is calculated to be 21, b is 8, and m is 26. To begin, write the numeric equivalents to each letter in the ciphertext, as shown in the table below

Decrypting Now, the next step is to compute 21(y − 8), and then take the remainder when that result is divided by 26. The following table shows the results of both computations

Decrypting The final step in decrypting the ciphertext is to use the table to convert numeric values back into letters. The plaintext in this decryption is AFFINECIPHER. Below is the table with the final step completed.

Example Entire alphabet encoded