Professional Documents
Culture Documents
Given Name: Yawar Surname: Abbas Nationality: Pakistani University: Wuhan University
Given Name: Yawar Surname: Abbas Nationality: Pakistani University: Wuhan University
Given Name: Yawar Surname: Abbas Nationality: Pakistani University: Wuhan University
Surname : Abbas
Nationality : Pakistani
University : Wuhan University
Host Supervisor
Liu Jin Shuo
Agenda of the Presentation
Introduction
What is Cryptography?
Purpose Of cryptography
Architecture of cryptography
Types of Cryptography
Process of cryptography
Types Of cryptography Algorithms
Attacks of cryptography
Conclusion
INTRODUCTION
Global internet is internationally connected network of a
computers network with addresses, administrated by(IANA).
There are many aspects to security of many applications ranging
from secure commerce, payment to private communication and
protecting password, one essential aspect for secure
communication is that of cryptography.
What is Cryptography?
• Cryptography derived its name from Greek word called
“Krypto” which means hidden secrets.
• Cryptography is the practice & study of hiding information. It is
the art of converting a plain intelligible data into an
unintelligible data & again retransforming that message into
original form.
• It provides Confidentiality, integrity & accuracy.
PURPOSE OF CRYPTOGRAPHY
Authentication:
The process of providing one’s identity.
Confidentiality:
Ensuring that no one can read the message except the intendat
receiver.
Non-Repudiation:
The mechanism to prove that the sender really send this
message.
Integrity:
Assuring the receiver that the received message has not been
changed in any way from original.
Asymmetric Cryptography
It is also called public key cryptography.
It uses two key “a pair of keys for encryption and decryption.
Each entity has 2 keys:
Private Key (a secret)
Public key (well known).
Encryption
• Encryption convert the human-readable plaintext to
incomprehensible text, also known as cipher text. Thus, only
secure party can decipher it.
• Encryption requires the use of a encryption algorithm and
cryptographic key
Encryption
The type of operation for transforming plain text to cipher text
Substitution
• Simply, replacing each letter of plain text by some other
letter to convert it to cipher text
• ABCD (Plain Text) -> EFGH (Cipher Text)
Transformation / Permutation
• Jumbling up the letters of plain text to confuse the attacker
• ABCD (Plain Text) -> CDAB (Cipher Text)
Encryption
Encryption depends upon three factors
1. Procedure for the Formation of cipher text from plain text
A B
Encry Coded decryp
Hello Hello
ption format tion
Plain text plain text
Size of block, key, and the functions using in the process are determined by the
algorithm
128 bit block cipher will convert the data into blocks of 128 bit size
These blocks are encrypted individually they are chained together to form a
cipher text.
64 64 64 64 64 64
Block Cipher
Plain Text
64 64 64 64 64 64
64 64 64 64 64 64
Cipher Text
64 64 64 64 64 64
Block & Stream Ciphers
Symmetric Encryption
A private-key encryption is defined by
Message space X and algorithms (Key generation algorithm, encryption algorithm
and decryption algorithm)
Key Generation algorithm
is a randomized algorithm that chooses a key K.
Encryption Algorithm
Takes two inputs: A key K and Message X and its output a cipher text C
C<- Enck(m)
Decryption Algorithm
takes Key K and cipher text C and it outputs a message m or error
M:=Deck(c)
Encryption is randomized process whereas decryption is a deterministic process.
Deck(Enck(m))=m
Limitation of Symmetric Encryption
Need a strong encryption algorithm
XOR + F
L1 R1
Plain Text
64 Bits
Round 1
L0 R0
Divided in to two equal halves
XoR
+ F
L1 R1
Round 2
+ F
L2 R2
Triple DES (3DES)
Repeats basic DES algorithm three times using either two or three
unique keys
First standardized for use in financial applications in ANSI standard
X9.17 in 1985
Attractions:
168-bit key length overcomes the vulnerability to brute-force
attack of DES
Underlying encryption algorithm is the same as in DES
Drawbacks:
Algorithm is sluggish in software
Uses a 64-bit block size
Triple DES (3DES)
Original Cipher
Encryption
Plain Text Text 1
Key 1
Triple DES (3DES)
Original Cipher
Encryption
Plain Text Text 1
Encryption Cipher
Text 2
Key 1
Key 2
Triple DES (3DES)
Final
Original Cipher Cipher Test
Encryption
Plain Text Text 1
Encryption Cipher
Encryption
Text 2
Key 1
Key 2
Key 3
Advance Encryption Standard - AES
Published as a FIPS 197 standard in 2001
Cipher
AES Design
Cipher
AES Design
128 Bits
Plain Text
192 Bits Secret Key
256 Bits
Cipher
Cipher Text
Rounds
10,12,14 rounds for 128,192,256 bit keys
Regular rounds(9,11,13)
Final rounds is different(10th ,12th ,14th )
Rounds
10,12,14 rounds for 128,192,256 bit keys
Regular rounds(9,11,13)
Final rounds is different(10th ,12th ,14th )
Sub bytes
Shift
Rows
Rounds
Max
Columns
Add
rounds key
Rounds
Bits Key Length Block Size Number of
rounds
AES-128 4 4 10
AES-192 6 4 12
AES-256 8 4 14
State
in2 in6 in10 in14 S2,0 S 2,1 S2,2 S 2,3 Out Out Out Out
1 5 9 13
in3 in7 in11 1in15 S3,0 S 3,1 S3,2 S 3,3
Out Out Out Out
2 6 10 14
Out Out Out Out
3 7 11 15
Attacking Symmetric Encryption
Cryptanalytic Attacks Brute-Force Attacks
Rely on:
Try all possible keys on some
Nature of the algorithm cipher text until an intelligible
Some knowledge of the translation into plaintext is
obtained
general characteristics of
On average half of all
the plaintext
possible keys must be
Some sample plaintext- tried to achieve success
cipher text pairs
If successful all future and
past messages encrypted
with that key are
compromised
Attacks of cryptography
Cipher text only attack
The only data available is a target cipher text
Known plaintext attack
A target cipher text
Pairs of other cipher text and plaintext (say, previously
broken or guessing)
Attacks of cryptography
Chosen plaintext attacks
A target cipher text
Can feed encryption algorithm with plaintexts and
obtain the matching cipher texts
Chosen cipher text attack
A target cipher text
Can feed decryption algorithm with cipher texts and obtain
the matching plaintext matching cipher texts
Hash functions
The ideal cryptographic hash function has four main
properties:
• It is easy to compute the hash value for any given message
• It is infeasible to generate a message from its hash
• It is infeasible to modify a message without changing the hash
• It is infeasible to find two different messages with the same
hash
Security of Hash Functions
Public-Key Encryption Structure
Architecture of cryptography
Public/Private Key Cryptography
Asymmetric key cryptography overcomes the key management
problem by using different encryption and decryption key
pairs. Having knowledge of one key, say the encryption key, is
not sufficient enough to determine the other key - the
decryption key.