Classification of Ciphers using Machine Learning

Slides:



Advertisements
Similar presentations
Solving Systems by Graphing or Substitution.
Advertisements

Conventional Encryption: Algorithms
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.
Digital Kommunikationselektroink TNE027 Lecture 6 (Cryptography) 1 Cryptography Algorithms Symmetric and Asymmetric Cryptography Algorithms Data Stream.
Advanced Encryption Standard(AES) Presented by: Venkata Marella Slide #9-1.
Announcements  Project teams should be decided today! Otherwise, you will work alone.  If you have any question or uncertainty about the project, talk.
Introduction to Symmetric Block Cipher Jing Deng Based on Prof. Rick Han’s Lecture Slides Dr. Andreas Steffen’s Security Tutorial.
Support Vector Machines
Dr Alejandra Flores-Mosri Security Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to: –Describe the.
3-6 Solving Systems of Linear Equations in Three Variables Objective: CA 2.0: Students solve systems of linear equations and inequalities in three variables.
Solving Systems of three equations with three variables Using substitution or elimination.
L1.1. An Introduction to Classical Cryptosystems Rocky K. C. Chang, February 2013.
Encryption Schemes Second Pass Brice Toth 21 November 2001.
3.5 Solving systems of equations in 3 variables
5.3 Solving Systems using Elimination
Cryptanalysis. The Speaker  Chuck Easttom  
7.1 SOLVING SYSTEMS BY GRAPHING The students will be able to: Identify solutions of linear equations in two variables. Solve systems of linear equations.
A Cryptography Education Tool Anna Yu Department of Computer Science College of Engineering North Carolina A&T State University June 18, 2009.
Dan Boneh Introduction History Online Cryptography Course Dan Boneh.
Table of Contents Topic Page # A Absolute Value Less ThAND B Absolute Value GreatOR Than Two Variable Inequalities Solve Systems.
Linear Fault Analysis of Block Ciphers Zhiqiang Liu 1, Dawu Gu 1, Ya Liu 1, Wei Li 2 1. Shanghai Jiao Tong University 2. Donghua University ACNS 2012 June.
Network Security Lecture 14 Presented by: Dr. Munam Ali Shah.
Do Now 1/13/12  In your notebook, list the possible ways to solve a linear system. Then solve the following systems. 5x + 6y = 50 -x + 6y = 26 -8y + 6x.
Section 4-1: Introduction to Linear Systems. To understand and solve linear systems.
Stream Ciphers and Block Ciphers A stream cipher is one that encrypts a digital data stream one bit or one byte at a time. Examples of classical stream.
8.6. Knapsack Ciphers. The Concept At the core of the Knapsack cipher is the Knapsack problem: At the core of the Knapsack cipher is the Knapsack problem:
Description of a New Variable-Length Key, 64-Bit Block Cipher (BLOWFISH) Bruce Schneier BY Sunitha Thodupunuri.
6-2B Solving by Linear Combinations Warm-up (IN) Learning Objective: to solve systems of equations using linear combinations. Solve the systems using substitution.
Systems of Equations and Inequalities
Elimination Method: Solve the linear system. -8x + 3y=12 8x - 9y=12.
7.4. 5x + 2y = 16 5x + 2y = 16 3x – 4y = 20 3x – 4y = 20 In this linear system neither variable can be eliminated by adding the equations. In this linear.
Objective The student will be able to: solve systems of equations using elimination with addition and subtraction. SOL: A.4e Designed by Skip Tyler, Varina.
Systems of Linear Equations in Two Variables. 1. Determine whether the given ordered pair is a solution of the system.
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (2) Information Security.
Solving Linear Systems by Substitution
Linear Programming The Table Method. Objectives and goals Solve linear programming problems using the Table Method.
WARM UP GRAPHING LINES Write the equation in slope- intercept form and then Graph. (Lesson 4.7) 1.3x + y = 1 2.x + y = 0 3.y = -4 3.
Bell Ringer: Combine like terms 1)4x + (-7x) = 2)-6y + 6y = 3)-5 – (-5) = 4)8 – (-8) =
Solving Systems of Linear Equations Elimination. Making Equivalent Equations Multiply the following 3 times x + y = 2 -2 times 3x + y = 3.
SOLVING SYSTEMS USING ELIMINATION 6-3. Solve the linear system using elimination. 5x – 6y = -32 3x + 6y = 48 (2, 7)
Solving systems of equations with three variables January 13, 2010.
CSE 5/7353 – January 25 th 2006 Cryptography. Conventional Encryption Shared Key Substitution Transposition.
Solve Linear Systems by Elimination February 3, 2014 Pages
Algebra Review. Systems of Equations Review: Substitution Linear Combination 2 Methods to Solve:
@Yuan Xue CS 285 Network Security Block Cipher Principle Fall 2012 Yuan Xue.
Elimination Method - Systems. Elimination Method  With the elimination method, you create like terms that add to zero.
Section 9.4 – Solving Differential Equations Symbolically Separation of Variables.
@Yuan Xue Quick Review.
3.2.1 – Linear Systems, Substitution
Does the set S SPAN R3 ?.
Algebra 1 Section 7.3 Solve linear systems by linear combinations
Solving Linear Equations
Section 11.2: Solving Linear Systems by Substitution
3.2 Solve Linear Systems Algebraically
Solving Linear Systems by Linear Combinations
Solve a system of linear equation in two variables
Solve System by Linear Combination / Addition Method
3.5 Solving systems of equations in 3 variables
7.4 Solve Linear Systems by Multiplying First
Systems of Linear Equations in Two Variables
Like Terms and Evaluating Expressions
Systems of equations.
Simultaneous Equations
Machine Learning Week 3.
Linear Programming Example: Maximize x + y x and y are called
Solve the linear system.
Multivariable Linear Systems
Example 2B: Solving Linear Systems by Elimination
7.1 Solving Systems of Equations
Chapter 9 Lesson 4 Solve Linear Systems By Substitution
Presentation transcript:

Classification of Ciphers using Machine Learning - - Gopi Krishna Chitluri

Brief Introduction to Cryptography

Classical Ciphers Substitution Cipher Permutation Cipher Vigenere Cipher Combination of Substitution & Permutation Cipher

Modern Ciphers Blowfish Camellia RC4 IDEA DES AES

Support Vector Machine

Test Vector Blowfish (or Camellia) and RC4 ciphertext. Break them into 320 bit segments. Take few segments from each class and generate test vectors by solving following optimisation problem Maximize objective function f = ci subjected to a set of Blowfish (or Camellia) constraints of the form A test vector is a collection of a total of 321 variables, 320 variable value and one threshold value {c1, c2, …, c320, T}

Good Test Vector The test vector is applied over Blowfish and RC4 files. Test vectors which are good at classifying the ciphers with a success greater than particular threshold are called good test vectors. We apply these good test vectors on a file to determine the cipher. We call it Blowfish, if more than half of the good vectors classify this file as a Blowfish, otherwise we classify it as RC4.

Generating Trivially Good Test Vectors Use linear programming in the below equation to generate a set of test vectors. Maximize objective function f = ci subjected to a set of C1 constraints of the form

Generating Trivially Good Test Vectors Test vectors are applied on 500 C1 (Blowfish or Camellia) files and 500 RC4 files. We calculate threshold value T that would be able to distinguish C1 and RC4. These are called trivially good test vectors because their performance is slightly better than 50% accuracy. The performance of test vector is measured by β, if this test vector can classify 50+β files successfully. Experiments generated 9750 and 9675 trivially good test vectors for Blowfish - RC4 and Camellia - RC4 pairs respectively.

Modifying Trivially Good Test Vectors Modifying the whole test vector Modifying the first 160 positions of the test vectors Modifying the odd positions in the test vectors

Modifying The Whole Test Vector Add ε to all the 321 elements of the test vector.

Modifying the first 160 positions of the test vectors Add ε to the first 160 elements of the test vector.

Modifying the odd positions in the test vectors Add ε to the odd position elements of the test vector.

Effect of Goodness Threshold 𝛄

Conclusion Support Vector Machines are used to classify good test vectors and bad test vectors. Effect of goodness threshold 𝛄 is linear increase in training and testing errors. Distinguishing between good and bad test vectors is simpler when goodness threshold is lower.

References http://www.security.iitk.ac.in/contents/projects/cryptanaly sis/repository/pooja.ps http://www.security.iitk.ac.in/contents/projects/cryptanaly sis/repository/girish.pdf http://www.security.iitk.ac.in/contents/projects/cryptanaly sis/repository/anoopjain.pdf http://www.security.iitk.ac.in/contents/publications/more/c iphers_machine_learning.pdf

Questions?