CRYPTANALYSIS OF STREAM CIPHER Bimal K Roy Cryptology Research Group Indian Statistical Institute Kolkata.

Slides:

Advertisements

Similar presentations

CLASSICAL ENCRYPTION TECHNIQUES

Advertisements

Cryptography encryption authentication digital signatures

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

“Advanced Encryption Standard” & “Modes of Operation”

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.

Computer Science 101 Data Encryption And Computer Networks.

Digital Kommunikationselektroink TNE027 Lecture 6 (Cryptography) 1 Cryptography Algorithms Symmetric and Asymmetric Cryptography Algorithms Data Stream.

Stream ciphers 2 Session 2. Contents PN generators with LFSRs Statistical testing of PN generator sequences Cryptanalysis of stream ciphers 2/75.

Fubswrjudskb Frxuvh qxpehu: / Lqvwuxfwru:Lyrqd Ehcdnryd Wrgdb’v Wrslfv: 1.Orjlvwlfv: -Fodvv olvw -Vboodexv 2. Wkh Pdwk 3. Zkdw lv Fubswrjudskb.

Announcements: Matlab: tutorial available at Matlab: tutorial available at

EEC 688/788 Secure and Dependable Computing Lecture 4 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University

CSE331: Introduction to Networks and Security Lecture 17 Fall 2002.

Stream Ciphers 1 Stream Ciphers. Stream Ciphers 2 Stream Ciphers  Generalization of one-time pad  Trade provable security for practicality  Stream.

Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

An Introduction to Cryptology and Coding Theory Sarah Spence Adams Olin College Gordon Prichett Babson College

Computer Security CS 426 Lecture 3

IT 221: Classical and Modern Encryption Techniques Lecture 2: Classical and Modern Encryption Techniques For Educational Purposes Only Revised: September.

Chapter 2 – Classical Encryption Techniques

Cryptography Week-6.

Cryptanalysis. The Speaker  Chuck Easttom  

EE5552 Network Security and Encryption block 4 Dr. T.J. Owens CEng MIET Dr T. Itagaki MIET, MIEEE, MAES.

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

symmetric key cryptography

Códigos y Criptografía Francisco Rodríguez Henríquez A Short Introduction to Stream Ciphers.

One-Time Pad Or Vernam Cipher Sayed Mahdi Mohammad Hasanzadeh Spring 2004.

CS555Spring 2012/Topic 51 Cryptography CS 555 Topic 5: Pseudorandomness and Stream Ciphers.

Lec. 5 : History of Cryptologic Research II

Cryptography and Network Security (CS435) Part Two (Classic Encryption Techniques)

1 Chapter 2-1 Conventional Encryption Message Confidentiality.

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

Symmetric-Key Cryptography

Terminology and classical Cryptology

Classical Encryption techniques

Cryptography Team Presentation 2

Part 9, Basic Cryptography 1. Introduction A cryptosystem is a tuple: ( M,K,C, E,D) where M is the set of plaintexts K the set of keys C the set of ciphertexts.

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

Cryptography Lynn Ackler Southern Oregon University.

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

Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.

Part 9, Basic Cryptography 1. Introduction A cryptosystem is a tuple: ( M,K,C, E,D) where M is the set of plaintexts K the set of keys C the set of ciphertexts.

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.

Traditional Symmetric-Key Ciphers

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

Cryptography and Authentication A.J. Han Vinck Essen, 2008

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

CRYPTOGRAPHY PRESENTED BY : NILAY JAYSWAL BRANCH : COMPUTER SCIENCE & ENGINEERING ENTRY NO. : 14BCS033 1.

CS555Spring 2012/Topic 31 Cryptography CS 555 Topic 3: One-time Pad and Perfect Secrecy.

Block Ciphers and the Data Encryption Standard. Modern Block Ciphers  One of the most widely used types of cryptographic algorithms  Used in symmetric.

EEC 688/788 Secure and Dependable Computing Lecture 3 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

1 Introduction CS 303 Algorithmic Number Theory and Cryptography Jeremy R. Johnson.

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

1 Classical Encryption Techniques. 2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher.

CHAPTER 14 ENCRYPTION AND DECRYPTION Sajina Pradhan

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

Computer Security By Rubel Biswas. Introduction History Terms & Definitions Symmetric and Asymmetric Attacks on Cryptosystems Outline.

Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.

หัวข้อบรรยาย Stream cipher RC4 WEP (in)security LFSR CSS (in)security.

CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”

Chapter 2 Basic Encryption and Decryption

CH15 –Security & Crypto.

Chapter-2 Classical Encryption Techniques.

STREAM CIPHERS by Jennifer Seberry.

Types of Cryptanalysis attacks

Symmetric Encryption or conventional / private-key / single-key

Presentation transcript:

CRYPTANALYSIS OF STREAM CIPHER Bimal K Roy Cryptology Research Group Indian Statistical Institute Kolkata

Preliminaries Cryptosystem: A mechanism for providing a secure means of information exchange. Cryptographer: A person who designs a cryptosystem Cryptanalyst: One who tries to attack the cryptosystem Message/Plaintext Ciphertext/Cipher Key Encryption: Process of transforming the message into cipher Decryption:Recovering the actual message from the cipher A cryptosystem is specified by the encryption and decryption procedure.

Classical Cryptography Caesar Cipher: Plaintext(P) and Cipher (C) are English alphabet and Key(K) denotes no. of shifts. Substitution Cipher: Here P & C are same and K is a permutation of the 26 symbols. Cryptanalysis cipher-text only known plain-text chosen plain-text Caesar Cipher: Too small key-space Substitution Cipher: Frequency attack

Stream Cipher Plaintext(P): binary bit string Key-string(K): pseudo random binary string ciphertext(C): bitwise XOR (addition modulo 2) of P & K e.g: P : K: C: Here Pr[P=0]=2/3; Pr[P=1]=1/3 Pr[P=0|C=0]= Pr[P=0|C=1]=2/3 Pr[P=1|C=0]= Pr[P=1|C=1]=1/3 This gives Pr[P]= Pr[P|C]

Shannon’s notion of Perfect Secrecy A cryptosystem has perfect secrecy if the above condition is satisfied => posterior prob. of the plain text given cipher text is equal to the a-priori prob. of the plain text e.g: one-time pad requires infinte sequence of random bits! REALITY : pseudo random no. generator Linear Feedback Shift Register

LFSR Connection Polynomial : c(x) = 1+x^2+x^3 If c(x) is primitive then each non-zero initial state produces an o/p sequence of maximum period Note: Each o/p bit is a linear function of the initial seed s 4 =s 3 +s 1 s 5 =s 4 +s 2 s 6 =s 5 +s 3...

One LFSR Generator Drawback: known plaintext attack solving a set of linear equations General Model key: generally the seeds (sometimes includes c(x) & f) LFSR1 LFSR2 LFSRn f K P C

Attacks on this Model Siegenthaler attack C = Y + P Y= X 1 if X 3 = 0 = X 2 if X 3 =1 For popularly used Murray code, Prob[P=0] = 0.58 Prob[Y=X 1 ] = Prob[Y=X 2 ] = 3/4 and Prob[Y=X 3 ]=1/2 Prob[C=X 1 ]=Prob[Y=X 1 ].Prob[P=0] + Prob[Y!=X 1 ].Prob[P=1] =0.54 LFSR1LFSR2 LFSR3 Y P X1X1 X2X2 X3X3 C

Attacks (contd.) Prob[C=X 1 ]= Prob[C=X 2 ]= 0.54 Prob[C=X 3 ]= 0.50 Attack on the basis of |{ i : X i = C i }| Fast Correlation Attack »using coding theory Let C(x) = 1+ x^2 + x^3 initial state LFSR o/p

Attacks (contd.) Observation: The set of o/p sequence of a length k maximum length LFSR is a (2 k - 1, k, 2 k-1 ) linear code. In the example above this forms a (7,3,4) linear code The minimum distance is quite high! This code can correctly decode if there has been error in about 25% of the bits.

Fast Correlation Attack (contd.) Decoding: Apply Majority Logic Principle Cryptanalysis LFSR1 LFSR2 LFSR3 f K P C Channel Corrupted Codeword

MAJORITY LOGIC DECODING In our 3-stage LFSR with c(x)=1+x^2+x^3 s i + s i+2 + s i+3 =0 for i =1,2,3,… c(x) is the parity-check polynomial of the code. Every multiple of c(x) specifies another parity check The parity check equations over one period give - s 1 +s 3 + s 4 = 0(*) s 2 + s 4 + s 5 = 0 s 3 + s 5 + s 6 = 0 s 4 + s 6 + s 7 = 0 s 5 + s 7 + s 1 = 0(**) s 6 + s 1 +s 2 = 0(***) s 7 + s 2 + s 3 = 0 Along with s 1 = s 1 we get four independent decisions when errors are present.

MAJORITY LOGIC DECODING (contd.) codeword corrupted codeword Form the 4 linear equations as follows : s 1 = s 1 (= 1) s 1 = s 3 + s 4 (= 0) s 1 = s 5 + s 7 (= 0) s 1 = s 2 + s 6 (= 0) Now take a majority vote. This is a bit by bit decoding.