Index of Coincidence Meghan Emilio Professor Ralph Morelli February 18, 2004.

Slides:

Advertisements

Similar presentations

Kyle Johnson. Cryptology Comprised of both Cryptography and Cryptanalysis Cryptography - which is the practice and study of techniques for secure communication.

Advertisements

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

Cryptology  Terminology  plaintext - text that is not encrypted.  ciphertext - the output of the encryption process.  key - the information required.

1 Codes, Ciphers, and Cryptography-Ch 2.3 Michael A. Karls Ball State University.

Enigma Meghan Emilio Faculty Sponsor: Ralph Morelli (Computer Science)

Chapter 7 Introduction to Sampling Distributions

The Enigma Encryption System Andrew Regan CSC 290.

Foundations of Network and Computer Security J J ohn Black Lecture #3 Aug 28 th 2009 CSCI 6268/TLEN 5550, Fall 2009.

Shannon ’ s theory part II Ref. Cryptography: theory and practice Douglas R. Stinson.

1 Introduction to Biostatistics (PUBHLTH 540) Sampling.

CYPHER INDEX n Introduction n Background n Demo INTRODUCTION n Cypher is a software toolkit designed to aid in the decryption of standard (historical)

Enigma Meghan Emilio Advisor: Professor Ralph Morelli April 2004.

Chapter 11: Random Sampling and Sampling Distributions

Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.

Introduction to Cryptography

Introductory Statistics for Laboratorians dealing with High Throughput Data sets Centers for Disease Control.

Dan Boneh Introduction History Online Cryptography Course Dan Boneh.

Classical Monoalphabetic Ciphers Day 2. Keyword cipher Select a keyword, if the keyword has any repeated letters, drop all but the first occurrence. Write.

Cracking the Code: Foundations of Cryptology A brief introduction to the underlying terms and concepts of cryptography and cryptanalysis Martina Weber.

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.

Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.

Lecture 2 Overview.

Confusion and Diffusion1 Ref: William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall, 2003.

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

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.

a connection between language and mathematics

Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.

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

Network Security Section 1: Introduction to security.

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.

CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Classical Cryptography.

1 Chapter 2-1 Conventional Encryption Message Confidentiality.

Section 2.7: The Friedman and Kasiski Tests Practice HW (not to hand in) From Barr Text p. 1-4, 8.

Announcements: Please pass in Assignment 1 now. Please pass in Assignment 1 now. Assignment 2 posted (when due?) Assignment 2 posted (when due?)Questions?

Polyalphabetic CIPHERS Linguistics 484. Summary The idea How to recognize: index of coincidence How many alphabets: Kasiski.

Vigenére Cipher Kimberly Chiffens & Maria Jannelli.

Introduction to Ciphers Breno de Medeiros. Cipher types From “Cipher”, Wikipedia article.

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

Dan Boneh Symmetric Encryption History Crypto. Dan Boneh History David Kahn, “The code breakers” (1996)

1 Cryptanalysis Four kinds of attacks (recall) The objective: determine the key ( Herckhoff principle ) Assumption: English plaintext text Basic techniques:

CRYPTOGRAPHY. TOPICS OF SEMINAR Introduction & Related Terms Categories and Aspects of cryptography Model of Network Security Encryption Techniques Public.

Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.

The Mean : A measure of centre The mean (often referred to as the average). Mean = sum of values total number of values.

Welcome to Cryptology 1 st Semester – Room B310. Syllabus.

Vigenére Cipher Kimberly Chiffens & Maria Jannelli.

CSC 386 – Computer Security Scott Heggen. Agenda Cryptography (i.e., Confusion and Diffusion)

Encryption CS110: Computer Science and the Internet.

Introduction to Cryptography Lecture 8. Polyalphabetic Substitutions Definition: Let be different substitution ciphers. Then to encrypt the message apply.

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

Lecture 2 Overview. Cryptography Secret writing – Disguised data cannot be read, modified, or fabricated easily – Feasibility of complexity for communicating.

@Yuan Xue CS 285 Network Security Block Cipher Principle Fall 2012 Yuan Xue.

COMPUTER AND NETWORK SECURITY First of all, an introduction to the field of computer security and some of relevant issues are presented. Then, a background.

CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.

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

Chapter 2 Basic Encryption and Decryption

Asad Gondal Ali Haider Mansoor

Monkeys and Coincidences

Section 2.7 The Friedman and Kasiski Tests

Introduction Of System Security

Outline Some Basic Terminology Symmetric Encryption

Classical Cryptography

Kasiski Method Reference

Fun with Cryptography The Science of Secrecy.

Confusion and Diffusion

Cryptography: Cesar Cipher

. Columnar Transposition

Meghan Emilio Professor Ralph Morelli February 18, 2004

Presentation transcript:

Index of Coincidence Meghan Emilio Professor Ralph Morelli February 18, 2004

Introduction Index of Coincidence (IC) is a statistical measure of text which distinguishes text encrypted with a substitution cipher from plain text. IC was introduced by William Friedman in The Index of Coincidence and its Applications in Cryptography (1920) It has been called "the most important single publication in cryptology”.

The Idea IC is defined to be the probability that two randomly selected letters will be identical. Imagine a hat filled with the 26 letters of the alphabet. The chance of pulling out an A is 1 / 26. If we had two such hats. The probability of pulling out two As simultaneously is ( 1 / 26 )*( 1 / 26 ). The chance of drawing any pair of letters is 26*( 1 / 26 )*( 1 / 26 ) = ( 1 / 26 ) = So the IC of an evenly distributed set of letters is

Suppose we fill the hats with 100 letters, and had the number of each letter correspond to the average frequency of that letter in the English language. (i.e. 8 As, 3 Cs, 13 Es, etc.) The chance of drawing any pair of identical letters is ( 8 / 100 )*( 8 / 100 ) + ( 3 / 100 )( 3 / 100 ) + ( 13 / 100 )( 13 / 100 ) + … = This is the IC for English. Every language has such an IC, for example: Russian: German: Spanish: The Idea (cont.)

Calculating the IC The formula used to calculate IC: Σ (f i * (f i -1)) N(N-1) where 0 > i > 25, f i is the frequency of the i th letter of the alphabet in the sample, and N is the number of letters in the sample

Example The IC of the text THE INDEX OF COINCIDENCE would be given by: c(3*2)+ d(2*1)+ e(4*3)+ f(1*0)+ h(1*0)+ i(3*2)+ n(3*2)+ o(2*1)+ t(1*0)+ x(1*0) = 34 divided by N*(N-1) = 21*20 = 420 which gives us an IC of 34/420 = The IC of the text BMQVSZFPJTCSSWGWVJLIO would be given by: b(1*0)+ c(1*0)+ f(1*0)+ g(1*0)+ i(1*0)+ j(2*1)+ l(1*0)+ m(1*0)+ o(1*0) + p(1*0)+ q(1*0)+ s(3*2)+ t(1*0)+ v(2*1)+ w(2*1)+ z(1*0) = 12 divided by N*(N-1) = 21*20 = 420 which gives us an IC of 12/420 =

How is this helpful? IC can be used to test if text is plain text or cipher text. Text encrypted with a substitution cipher would have an IC closer to , since the frequencies would be closer to random. English plaintext would have an IC closer to This measure allows computers to score possible decryptions effectively.

References Kahn, David. The Codebreakers. The MacMillan Company, New York:

Questions?