By: Kirti Chawla. Introduction Classification Algorithms Vis-à-Vis Looking back What is a Cipher or Crypto-algorithm ? A method or system for transforming.

Slides:



Advertisements
Similar presentations
Chapter 3 Public Key Cryptography and Message authentication.
Advertisements

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
L8. Reviews Rocky K. C. Chang, May Foci of this course 2 Rocky K. C. Chang  Understand the 3 fundamental cryptographic functions and how they are.
Lecture 7 Overview. Advanced Encryption Standard 10, 12, 14 rounds for 128, 192, 256 bit keys – Regular Rounds (9, 11, 13) – Final Round is different.
Conventional Encryption: Algorithms
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.
Rachana Y. Patil 1 Data Encryption Standard (DES) (DES)
Principles of Information Security, 2nd edition1 Cryptography.
Web Security for Network and System Administrators1 Chapter 4 Encryption.
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
Lesson Title: Introduction to Cryptography Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas
Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.
First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown and edited by Archana Chidanandan Cryptographic Tools.
Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.
McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
Introduction to Symmetric Block Cipher Jing Deng Based on Prof. Rick Han’s Lecture Slides Dr. Andreas Steffen’s Security Tutorial.
Cryptography April 20, 2010 MIS 4600 – MBA © Abdou Illia.
Dr Alejandra Flores-Mosri Security Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to: –Describe the.
Lecture 23 Symmetric Encryption
What is Cryptography? Definition: The science or study of the techniques of secret writing, esp. code and cipher systems, methods, and the like Google.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
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.
Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)
Encryption Methods By: Michael A. Scott
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Data Encryption Standard (DES). Symmetric Cryptography  C = E(P,K)  P = D(C,K)  Requirements  Given C, the only way to obtain P should be with  the.
1 Chapter 4 Encryption. 2 Objectives In this chapter, you will: Learn the basics of encryption technology Recognize popular symmetric encryption algorithms.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
© Neeraj Suri EU-NSF ICT March 2006 DEWSNet Dependable Embedded Wired/Wireless Networks MUET Jamshoro Computer Security: Principles and Practice Slides.
Dr. Khalid A. Kaabneh Amman Arab University
I-4 security.
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (1) Information Security.
Security+ Guide to Network Security Fundamentals, Third Edition Chapter 11 Basic Cryptography.
Crypto Bro Rigby. History
Chapter 8: Scrambling Through Cryptography Security+ Guide to Network Security Fundamentals Second Edition.
Information Systems Security
Chapter 20 Symmetric Encryption and Message Confidentiality.
Cryptography, Authentication and Digital Signatures
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security PART VII.
Midterm Review Cryptography & Network Security
Chapter 20 Symmetric Encryption and Message Confidentiality.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.
Bit Cipher 1. Example of bit Cipher 2 Practical Stream Cipher 3.
Improving Encryption Algorithms Betty Huang Computer Systems Lab
Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!
30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Introduction to cryptography by konrad. Introduction to cryptography Cryptography is the process of encrypting/decrypting data streams using some E(M)/D(M)
Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 2 – Cryptographic.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security.
30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Lecture 2: Introduction to Cryptography
24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,
Lecture 23 Symmetric Encryption
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security PART VII.
Symmetric Encryption Lesson Introduction ●Block cipher primitives ●DES ●AES ●Encrypting large message ●Message integrity.
Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2-
Invitation to Computer Science 5 th Edition Chapter 8 Information Security.
Network Security. Three tools Hash Function Block Cipher Public Key / Private Key.
Encryption Encryption: Transforms Message so that Interceptor Cannot Read it –Plaintext (original message) Not necessarily text; Can be graphics, etc.
Lecture 9 Overview. RSA Invented by Cocks (GCHQ), independently, by Rivest, Shamir and Adleman (MIT) Two keys e and d used for Encryption and Decryption.
1 Introduction to Cryptography Chapter-4. Definitions  Cryptography = the science (art) of encryption  Cryptanalysis = the science (art) of breaking.
Cryptography.
- Stream Cipher and Block Cipher - Confusion & Diffusion
Analysis of the RSA Encryption Algorithm
Unit 2: Cryptography & Cryptographic Algorithm
Computer Security Chapter Two
Presentation transcript:

By: Kirti Chawla

Introduction Classification Algorithms Vis-à-Vis Looking back What is a Cipher or Crypto-algorithm ? A method or system for transforming given information in order to conceal its meaning.

Introduction Classification Algorithms Vis-à-Vis Looking back Transposition ciphers Prologue Substitution ciphers Transposition Substitution Computers Can Only Execute Answers CCOEAoan xnmnlesp _ycwu__u et__tre_ _ess____ Computers Can Only Execute Answers Frpsxwhuv Fdq Rqob Hahfxwh Dqvzhuv

Introduction Classification Algorithms Vis-à-Vis Looking back Algorithms Genealogy Algorithms CiphersAuthenticators AsymmetricSymmetric DES\3DES AES IDEA RC6 BlowFish … RSA ELGAMAL … SHA MD5 …

Algorithmic Parlance Introduction Classification Algorithms Vis-à-Vis Looking back Strong OpenKey-oriented

At the heart of Algorithms Introduction Classification Algorithms Vis-à-Vis Looking back Methods to do Categories Directional Behavior Anomalous Behavior Handling Key Management Controlled Chaos Creation Deciding Operations 1.Simple XOR 2.Modular Arithmetic with Polynomials 3.Relative Prime Factors 1.S-boxes & P-boxes 2.Inversion 3.Data distribution/redundancy 1.Self generation or ask from user 2.Key organization 3.Key protection 1.Buffer management 2.Padding and boundary cases 3.State management 1.Hash or One time PADs 2.Bi-directionality

Deciding Operations Introduction Classification Algorithms Vis-à-Vis Looking back This is secret message This is key Axaw sa dawawt sazawcsr This is secret message X 7 + x 5 + x This is key Axaw sa dawawt sazawcsr This is secret message Factorized key 1 Factorized key 2 Axaw sa dawawt sazawcsr Simple XOR Modular arithmetic with polynomials Relative prime factors

Controlled Chaos Creation Introduction Classification Algorithms Vis-à-Vis Looking back S-boxP-box InversionData distribution/redundancy 1010 (data) (data)

Key Management Introduction Classification Algorithms Vis-à-Vis Looking back Self-generationAsk from user 1010 (data) 1010 XOR 11 = (data) 0101 XOR 11 = 0110 Key organization (key) (key) Key protection (key)

Anomalous Behavior Handling Introduction Classification Algorithms Vis-à-Vis Looking back Buffer managementPadding Boundary casesState management [+] = Overflow Capture of as plain-text from buffer on which algorithm operate If the input data or key are not exactly fulfilling the algorithm requirements, lets say required input is of multiple of 2 and > 512 bit, but user does not provide … ! U/SIGN-INT * U/SIGN-INT > 65536/32768 If the algorithm works in various stages, each stage signifying a state and regurgitating partially (weak) cipher-text and hence making possible ‘interleaving’… !

Directional Behavior Introduction Classification Algorithms Vis-à-Vis Looking back Hash or one time PADs Bi-directionality Use one character once only for substitution. Destroy or delete encryption mechanism. Destroy or delete decryption mechanism. Hash differs from one time PADs in a way of producing output. Given the single algorithm, the enciphering and deciphering operations should be inverse of each other. Bi-directional nature of algorithm is there, because of need to get original data back.

A single key for enciphering and deciphering operations. More the number of bits of key, more secure your data. Algorithms are usually characterized as stream or block ciphers. Algorithmic proclivity to certain weak keys can create problem. Used generally for protecting data. Symmetric Ciphers Introduction Classification Algorithms Vis-à-Vis Looking back

One key for enciphering and another key for deciphering operation. More the distance between mutually prime nos. ( here they are key ), more secure your data. Used generally for protecting data as well for making sure its authentication. Asymmetric Ciphers Introduction Classification Algorithms Vis-à-Vis Looking back

Hash functions gives a fixed-length output for a arbitrary-length message. Strength of algorithm is measured by collision resistance. Uni-directionality is innate capability of authentication algorithms. Authentication is achieved by re-computing hash and compared with stored hash value. Authenticators Introduction Classification Algorithms Vis-à-Vis Looking back

Introduction Classification Algorithms Vis-à-Vis Looking back Egyptian pictorial substitution Caesar cipher Cipher cylinders Enigma DES/… algorithms