Cryptanalysis Network Security.

Slides:



Advertisements
Similar presentations
CLASSICAL ENCRYPTION TECHNIQUES
Advertisements

First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown and edited by Archana Chidanandan Cryptographic Tools.
1 Day 04- Cryptography Acknowledgements to Dr. Ola Flygt of Växjö University, Sweden for providing the original slides.
Ref: STAL03More Concepts of Cryptography and Cryptanalysis 1 Reference –William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall.
Lecture 23 Symmetric Encryption
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
Lecture 3: Cryptographic Tools modified from slides of Lawrie Brown.
Cryptography Week-6.
Cryptanalysis. The Speaker  Chuck Easttom  
© Neeraj Suri EU-NSF ICT March 2006 DEWSNet Dependable Embedded Wired/Wireless Networks MUET Jamshoro Computer Security: Principles and Practice Slides.
Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.
Chapter 2 – Elementary Cryptography  Concepts of encryption  Cryptanalysis  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public.
Chapter 20 Symmetric Encryption and Message Confidentiality.
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Chapter 20 Symmetric Encryption and Message Confidentiality.
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
Classical Encryption techniques
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 2 – Cryptographic.
Data Security and Encryption (CSE348) 1. Lecture # 3 2.
Lecture 23 Symmetric Encryption
K. Salah1 Cryptography Module I. K. Salah2 Cryptographic Protocols  Messages should be transmitted to destination  Only the recipient should see it.
Intro to Cryptography Lesson Introduction
Chapter 2 Symmetric Encryption.
Lecture 3 Page 1 CS 236 Online Introduction to Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
1 Classical Encryption Techniques. 2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher.
@Yuan Xue CS 285 Network Security Block Cipher Principle Fall 2012 Yuan Xue.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
CS457 Introduction to Information Security Systems
Chapter 2 Basic Encryption and Decryption
Symmetric Algorithm of Cryptography
Columnar Transposition
Introduction Of System Security
Basic Encryption Methods
Chapter-2 Classical Encryption Techniques.
Encryption
Cryptography.
Part 1 By Dr. Shadi Masadeh
CSCI-235 Micro-Computer Applications
- Stream Cipher and Block Cipher - Confusion & Diffusion
Outline Desirable characteristics of ciphers Uses of cryptography
Cryptography and Network Security Sixth Edition by William Stallings.
مروري برالگوريتمهاي رمز متقارن(كليد پنهان)
Security through Encryption
Algorithm Types & Algorithm Modes
SYMMETRIC ENCRYPTION.
Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS
Introduction to Cryptography
Computer Security Chapter Two
Security Attacks, Mechanisms, and Services
Types of Cryptanalysis attacks
Basics Of Symmetric Encryption
Symmetric Encryption or conventional / private-key / single-key
Pseudorandom Numbers Network Security.
Hash Function Requirements
CRYPTOGRAPHY & NETWORK SECURITY
The RSA Public-Key Encryption Algorithm
Counter With Cipher Block Chaining-MAC
Digital Signature Standard (DSS)
Digital Signatures Network Security.
Elect. Codebook, Cipher Block Chaining
Stream Cipher Structure
Feistel Cipher Structure
Message Authentication
Simple Hash Functions Network Security.
Presentation transcript:

Cryptanalysis Network Security

Objectives of the Topic Cryptanalysis Objectives of the Topic After completing this topic, a student will be able to explain Cryptanalysis.

Figures and material in this topic have been Cryptanalysis Figures and material in this topic have been adapted from “Network Security Essentials: Applications and Standards”, 2014, by William Stallings.

Cryptanalysis Cryptography - study of encryption principles/methods. Cryptanalysis (code breaking) - study of principles/methods of deciphering ciphertext without knowing key.

Cryptanalysis Cryptographic systems are generically classified along three independent dimensions.

Cryptanalysis 1. The type of operations used for transforming plaintext to ciphertext. two general principles: Substitution Transposition

Cryptanalysis Substitution: Each element (bit, letter, group of bits or letters) in the plaintext is mapped into another element.

Cryptanalysis Transposition: Elements in the plaintext are rearranged. Fundamental requirement is that no information be lost. Product systems involve multiple stages of substitutions and transpositions.

Cryptanalysis 2. The number of keys used. Referred to as symmetric, single-key, secret-key, or conventional encryption if both sender and receiver use the same key.

Cryptanalysis Referred to as asymmetric, two-key, or public-key encryption if the sender and receiver each use a different key.

3. The way in which the plaintext is processed. Cryptanalysis 3. The way in which the plaintext is processed. A block cipher processes the input one block of elements at a time, producing an output block for each input block.

Cryptanalysis A stream cipher processes the input elements continuously, producing output one element at a time, as it goes along.

Cryptanalysis Cryptanalysis The strategy used by the cryptanalyst depends on the nature of the encryption scheme and the information available to the cryptanalyst.

Cryptanalysis Ciphertext Only: The cryptanalyst knows ciphertext only. Uses brute-force approach - try all possible keys. Make the key space very large so it becomes impractical. Easiest to defend

Cryptanalysis Known plaintext: The analyst may be able to capture one or more plaintext messages as well as their encryptions. Or he may know that certain plaintext patterns will appear in a message. May deduce the key.

Cryptanalysis Probable-word: An opponent may know parts of the message, then he can obtain specific information. E.g. an accounting file is being transmitted, placement of certain key words in the header of the file.

Cryptanalysis Chosen-plaintext: If the analyst is able to choose the messages to encrypt, the analyst may deliberately pick patterns that can be expected to reveal the structure of the key.

Cryptanalysis

Cryptanalysis The last two (chosen ciphertext and chosen text) are less commonly employed as cryptanalytic techniques but are nevertheless possible avenues of attack.

Cryptanalysis Only a relatively weak algorithm will fail to withstand a ciphertext-only attack. Generally, an encryption algorithm is designed to withstand a known-plaintext attack.

Cryptanalysis An encryption scheme is computationally secure if ciphertext generated by the scheme meets one or both of the criteria: The cost of breaking the cipher exceeds the value of the encrypted information.

Cryptanalysis The time required to break the cipher exceeds the useful lifetime of the information.

Cryptanalysis Brute Force attack: Involves trying every possible key until an intelligible translation of the ciphertext into plaintext is obtained On average, half of all possible keys must be tried to achieve success.

Cryptanalysis To supplement the brute-force approach Some degree of knowledge about the expected plaintext is needed. Some means of automatically distinguishing plaintext from garble is also needed. End