TOTURIAL CRYPTOGRAPHY Ver :1. Things to learn about  Concepts of encryption  Cryptanalysis  Symmetric encryption  Asymmetric encryption  Protocols.

Slides:



Advertisements
Similar presentations
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.
Advertisements

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Lesson 2 - Encryption ITD2323 Lecture by: IZWAN SUHADAK ISHAK Assistant Lecturer Universiti Industri Selangor.
Making “Good” Encryption Algorithms
1 Digital certificates One concern with the public key approach: must ensure that you are encrypting to the correct person’s public key  Otherwise, you.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 4 Wenbing Zhao Department of Electrical and Computer Engineering.
Chap 2: Elementary Cryptography.  Concepts of encryption  Cryptanalysis: how encryption systems are “broken”  Symmetric (secret key) encryption and.
EEC 688/788 Secure and Dependable Computing Lecture 4 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Network Management and Security
McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
Lecture 1 Overview.
IT 221: Classical and Modern Encryption Techniques Lecture 2: Classical and Modern Encryption Techniques For Educational Purposes Only Revised: September.
Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.
3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.
Cryptography Week-6.
A Cryptography Education Tool Anna Yu Department of Computer Science College of Engineering North Carolina A&T State University June 18, 2009.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
Lecture 2 Overview.
1st Class Discrete Structures الهياكل المتقطعة أستاذة المادة: م. م
Security in Computing Cryptography (Introduction) Derived from Greek words: ‘Kruptos’ (hidden) and ‘graphein’ (writing.
Computer System Security CSE 5339/7339
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.
Elementary Cryptography
Lec. 5 : History of Cryptologic Research II
CSCE 201 Introduction to Information Security Fall 2010 Data Protection.
Based on Applied Cryptography by Schneier Chapter 1: Foundations Dulal C. Kar.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Chapter 17 Security. Information Systems Cryptography Key Exchange Protocols Password Combinatorics Other Security Issues 12-2.
ITMS – 3153 Information Systems Security
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.
Symmetric-Key Cryptography
9/03/15UB Fall 2015 CSE565: S. Upadhyaya Lec 2.1 CSE565: Computer Security Lecture 2 Basic Encryption & Decryption Shambhu Upadhyaya Computer Science &
R R R CSE870: Advanced Software Engineering: Cheng (Sp 2003)1 Encryption A Brief Overview.
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
Lecture 3 Page 1 Advanced Network Security Review of Cryptography Advanced Network Security Peter Reiher August, 2014.
Traditional Symmetric-Key Ciphers
Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.
Computer Science and Engineering Computer System Security CSE 5339/7339 Lecture 3 August 26, 2004.
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
Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2-
CHAPTER 2 Elementary Cryptography 1. Objectives 2  Define the concept of encryption  Discuss different type of cryptography algorithms  Explain the.
R R R CSE870: Advanced Software Engineering: Cheng1 Encryption A Brief Overview.
Lecture 2 (Chapter 2) Classical Encryption Techniques Prepared by Dr. Lamiaa M. Elshenawy 1.
EEC 688/788 Secure and Dependable Computing Lecture 3 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Lecture 2 Overview. Cryptography Secret writing – Disguised data cannot be read, modified, or fabricated easily – Feasibility of complexity for communicating.
1 Classical Encryption Techniques. 2 Symmetric cipher model –Cryptography –Cryptanalysis Substitution techniques –Caesar cipher –Monoalphabetic cipher.
Chapter Two: Classic Cryptography
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.
1 Introduction to Cryptography Chapter-4. Definitions  Cryptography = the science (art) of encryption  Cryptanalysis = the science (art) of breaking.
CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.
@Yuan Xue Quick Review.
CRYPTOGRAPHY G REEK WORD MEANING “ SECRET WRITING ”
Substitution Ciphers.
CSE565: Computer Security Lecture 2 Basic Encryption & Decryption
Chapter 2 Basic Encryption and Decryption
Cryptography.
Cryptography II Jagdish S. Gangolly School of Business
PART VII Security.
Basic of Modern Cryptography
Presentation transcript:

TOTURIAL CRYPTOGRAPHY Ver :1

Things to learn about  Concepts of encryption  Cryptanalysis  Symmetric encryption  Asymmetric encryption  Protocols and certificates  Digital signatures  Types of encryption algorithms

Map Encryption Basic Concept Encryption Substitution (Penggantian) Transposition (Peralihan) MonoalphabeticPolyalphabeticColumnar Algorithm Transposition Double Transposition Algo Stream dan Block Ciphers Good Ciphers nature Shannon Characteristics Concept Confusion and Diffusion Testing information Theory Caesar Cipher Use of key Vigenere Tableux One Time Pad (Vernam Cipher) Technic for criptanalisys Kasiski method Index of Coefficient

Cryptography  Secret writing – strongest tool to control against many kinds of security threats  Users of cryptography usually do not create their encryption techniques – just use what’s available

Terminology  Imagine S (sender) sending a message to R (recipient) through T (transmission medium)  However there’s an intruder or interceptor (O) who tries to access the message in any of these: Block it – affects the availability Block it – affects the availability Intercept it – affecting the confidentiality Intercept it – affecting the confidentiality Modify it – affecting the integrity Modify it – affecting the integrity Fabricate it – affecting the integrity as well Fabricate it – affecting the integrity as well

Cryptography Evolution  500 BC-Pendita Hebrew introduce the Cryptography Code  Cipher Cryptanalisys Kasiski are introduced  1883-Sistem Enkripsi Kerchoff  1917-One-time pad by Gilbert Vernam (AT&T).  1917-Father of field the cryptanalysis US, William Friedman, Herbert Yardley.  1919-Rotor machine are create by Koch and Damm.

…continued  Encryption – the process of encoding a message (scrambling)  Decryption – the process to reverse, transforming encrypted message back to original form  Encode, decode, encipher, decipher are terms used in lieu of encrypt or decrypt  Encode could mean translating entire word or phrases into something new  Encipher could mean translating letters or symbols individually

…continued  Cryptosystem – a system for encryption and decryption  Plaintext, cleartext – original form  Ciphertext – encrypted (scrambled) form EncryptionDecryption PlaintextCiphertext Original Plaintext

Encryption Algorithms  Set of rules for how to encrypt plaintext and how to decrypt ciphertext  Often use a device called ‘key’ (K)  When C=E(K,P), it means E acts as an encryption algorithm, and K is the key. C is ciphertext; P is plaintext

…continued  When P=D(K, E(K,P)), it shows that both encryption and decryption keys are the same This form is called ‘symmetric’ encryption This form is called ‘symmetric’ encryption  When P=D(K D, E(K E,P)), it shows that encryption and decryption keys are NOT the same This form is called ‘asymmetric’ encryption This form is called ‘asymmetric’ encryption

…continued EncryptionDecryption PlaintextCiphertext Original Plaintext KEY EncryptionDecryption PlaintextCiphertext Original Plaintext KEKEKEKE KDKDKDKD Encryption Key Decryption Key SYMMETRIC ENCRYPTION ASYMMETRIC ENCRYPTION

…continued  A key gives flexibility in using an encryption scheme  Can create different encryptions by just changing the key  Provides additional security  Any encryption scheme that does not require a key = keyless cipher

Some interesting terms…  Cryptography – hidden writing, practice of using encryption to conceal text  Cryptanalyst – studies encryption and encrypted messages, hoping to find hidden messages  Cryptographer (& cryptanalyst) attempt to translate coded material to plaintext

…continued  Cryptographer works on behalf of a legitimate sender/receiver  Cryptanalyst works on behalf of an unauthorized interceptor  Cryptology – research into and study of encryption and decryption

Two simples types  Substitution One letter is exchanged for another One letter is exchanged for another Some call it monoalphabetic cipher or simple substitution Some call it monoalphabetic cipher or simple substitution  Transposition Order of the letters rearranged Order of the letters rearranged

Caesar Cipher ABCDEFGHIJKLMNOPQRSTUVWXYZ defghijklmnopqrstuvwxyzabc Plaintext Ciphertext In this example: Shift of 3 c i = E(p i ) = p i + 3 What would the ciphertext for UNISEL? Answer: xqlvho TREATY IMPOSSIBLE? Answer: wuhdwb lpsrvvleoh

Permutation  Almost like Caesar Cipher  Uses a word as the key  E.g. if ‘word’ is the key:  If ‘professional’ as the key:  If the word has several similar alphabets, only ONE of it should be used ABCDEFGHIJKLMNOPQRSTUVWXYZ wordabcefghijklmnpqstuvxyz Plaintext Ciphertext ABCDEFGHIJKLMNOPQRSTUVWXYZ profesinalbcdghjkmqtuvwxyz Tmepty adjhqqarce

…continued  Encrypt “TREATY IMPOSSIBLE” using both permutation algorithms Answer: Answer: spawsy fjmlqqfola Answer: tmepty adjhqqarce

…continued  Both types of permutation algorithms may invoke easy access by cryptanalyst, therefore it is more desirable to have less regular rearrangement of letters  A possibility is to count by three (or 5, or 7, or 9) and rearrange in that order

…continued ABCDEFGHIJKLMNOPQRSTUVWXYZ adgjmpsvybehknqtwzcfilorux  In this case, a+3=d, d+3=g, g+3=j  Encrypt “TREATY IMPOSSIBLE” Answer: fzmafu yktqccydhm

Vernam Cipher  Involves an arbitrarily long nonrepeating sequence of numbers combined with the plaintext  Equate each alphabet with corresponding number, add to its random 2-digit, find the mod of its sum with 26 to get the ciphertext

…continued ABCDEFGHIJKLMNOPQRSTUVWXYZ VERNAMCIPHER tahrspItxmab

Vigenère Cipher  Uses a table called “Vigen è re Tableau ”  Table is a series of alphabets from A to Z  Encryption is done from top to bottom, following the key which follows the ‘ Permutation ’ style key abcdefghijklmnopqrstuvwxyz A abcdefghijklmnopqrstuvwxyz B bcdefghijklmnopqrstuvwxyza C cdefghijklmnopqrstuvwxyzab X xyzabcdefghijklmnopqrstuvw Y yzabcdefghijklmnopqrstuvwx Z zabcdefghijklmnopqrstuvwxy

Transposition  Goal is confusion  Encryption in which the letters of the message are rearranged; breaking established patterns

Columnar Transposition  Rearranging characters of plaintext into columns  In a 5-column transposition, plaintext characters are written in rows of five and arranged one row after another:  Ciphertext is written from column to column C1C1C1C1 C2C2C2C2 C3C3C3C3 C4C4C4C4 C5C5C5C5 C6C6C6C6 C7C7C7C7 C8C8C8C8 C9C9C9C9 C 10 C 11 C 12 C 13 C 12 CnCnCnCn plaintext ciphertext

…continued THISISAMESSAGETOSHOWHOWACOLUMNARTRANSPOSITIONWORKS tssoh oaniw haaso lrsto imghw tssoh oaniw haaso lrsto imghw utpir seeoa mrook istwc nasns utpir seeoa mrook istwc nasnsPUTANXIFWORDSDONOTFILLALLCOLUMNSXXX pxrnl cnuid olost Fstal xawdf luxno oilmx

Public Key Encryption  Each user has a key that does not have to be kept secret  Secret is the decryption technique, not the key itself  Public key cryptosystem accomplish this goal by using two keys; one to encrypt and one to decrypt  Each user has two keys: a public key and a private key

…continued  P = D(k PRIV, E(k PUB, P))  Some public key encryption algorithms have this relationship: P=D(k PUB, E(k PRIV, P))

…continued  Let’s say there’s 3 users, B, C and D  All three have to send a message to A and each other  Each distinct pair of users needs a key, each user would need 3 different keys; A would need a key for B, C and D each.  With public key, each B, C and D can use A’ s public key to send the message, but A’s private key remains private, so C cannot decrypt message sent by B to A

Comparison Secret key (Symmetric) Public Key (Asymmetric) Number of Keys 12 Protection of key Must be kept secret One key must be kept secret, the other can be freely exposed Best uses Cryptographic workhorse; secrecy and integrity of data – single characters to blocks of data, messages, files Key exchange, authentication Key distribution Must be out-of-hand Public key can be used to distribute other keys SpeedFast Slow; typically, 10,000 times slower than secret key

Rivest-Shamir-Adelman (RSA) Encryption  A public key system  Introduced in 1978 and remains secure until now  Combines results from number theory with degree of difficulty in determining the prime factors of a given number  Uses two keys, d & e for decryption and encryption – either private or public key can be used in the encryption  P=E(D(P))=D(E(P))

…continued  C=P e mod n  P=C d mod n  P=C d mod n = (P e ) d mod n = (P d ) e mod n  Key choice: Consists of pair of integer (e,n) for encryption and integer (d,n) for decryption Consists of pair of integer (e,n) for encryption and integer (d,n) for decryption Start point to find value of n Start point to find value of n n should be quite large (a product of two prime numbers p and q)n should be quite large (a product of two prime numbers p and q) p and q are usually 100 digits eachp and q are usually 100 digits each e is relatively prime to (p-1)*(q-1)  e has no factors in common with (p-1)*(q-1) where e>(p-1) and e>(q-1)e is relatively prime to (p-1)*(q-1)  e has no factors in common with (p-1)*(q-1) where e>(p-1) and e>(q-1)

…continued  e * d = 1 mod (p-1)*(q-1)  Usually n is made public and d is kept secret