Seventh Edition, Global Edition

by William Stallings
 Chapter 3
Classical Encryption
Techniques
© 2017 Pearson Education, Ltd., All rights reserved.
 Definitions
Plaintext Ciphertext Enciphering/encrypt
ion
•An original message •The coded message
•The process of converting
from plaintext to
ciphertext

Deciphering/decrypt Cryptography Cryptographic

ion system/cipher
•The area of study of the
•Restoring the plaintext many schemes used for •A scheme
from the ciphertext encryption

Cryptanalysis Cryptology
•Techniques used for •The areas of
deciphering a message cryptography and
without any knowledge cryptanalysis
of the enciphering details

© 2017 Pearson Education, Ltd., All rights reserved.

© 2017 Pearson Education, Ltd., All rights reserved.
 Symmetric Cipher Model
• There are two requirements for secure use of
conventional encryption:
• A strong encryption algorithm

• Sender and receiver must have obtained copies

of the secret key in a secure fashion and must
keep the key secure

© 2017 Pearson Education, Ltd., All rights reserved.

© 2017 Pearson Education, Ltd., All rights reserved.
 Cryptographic Systems
• Characterized along three independent dimensions:

The type of operations

The number of keys The way in which the
used for transforming
used plaintext is processed
plaintext to ciphertext

Symmetric,
single-key, secret- Block cipher
Substitution
key, conventional (b >=2)
encryption

Asymmetric, two- Stream cipher

Transposition key, or public-key
encryption (b<2 b=1 =8 bit)

© 2017 Pearson Education, Ltd., All rights reserved.

 Cryptanalysis and
Brute-Force Attack
Cryptanalysis attack
• Attack relies on the nature of the
algorithm plus some knowledge of the
general characteristics of the plaintext
• Attack exploits the characteristics of
the algorithm to attempt to deduce a
specific plaintext or to deduce the key
being used
‫• يعتمد الهجوم على طبيعة الخوارزمية باإلضافة إلى‬
‫بعض المعرفة بالخصائص العامة للنص العادي‬
‫• يستغل الهجوم خصائص الخوارزمية لمحاولة‬
‫استنتاج نص عادي معين أو الستنتاج المفتاح‬
‫المستخدم‬
© 2017 Pearson Education, Ltd., All rights reserved.
Brute-force attack
• Attacker tries every possible key on
a piece of ciphertext until an
intelligible translation into plaintext
is obtained
• On average, half of all possible keys
must be tried to achieve success
‫• يحاول المهاجم في كل مفتاح ممكن على جزء من‬
‫النص المشفر حتى يتم الحصول على ترجمة‬
‫واضحة إلى نص عادي‬
‫ يجب تجربة نصف عدد المفاتيح‬، ‫• في المتوسط‬
‫الممكنة لتحقيق النجاح‬
 Brute Force Search
• always possible to simply try every key
• most basic attack, proportional to key size
• assume either know / recognise plaintext
‫من الممكن دائما و ببساطة تجربة كل مفتاح‬ •
‫ بما يتناسب مع حجم المفتاح‬، ‫الهجوم األساسي‬ •
‫ التعرف على النص العادي‬/ ‫افترض إما معرفة‬ •
Key Size (bits) Number of Alternative Time required at 1 Time required at 10 6
Keys decryption/µs decryptions/µs

32 232 = 4.3  109 231 µs = 35.8 minutes 2.15 milliseconds

56 256 = 7.2  1016 255 µs = 1142 years 10.01 hours
128 2128 = 3.4  1038 2127 µs = 5.4  1024 years 5.4  1018 years

168 2168 = 3.7  1050 2167 µs = 5.9  1036 years 5.9  1030 years
 Encryption Scheme Security
‫أمان نظام التشفير‬
• Unconditionally secure
• No matter how much time an opponent has, it is impossible for him or her to
decrypt the ciphertext simply because the required information is not there
(information is not enough). (e.g one-time pad)
‫❑ آمن بدون قيد أو شرط‬
‫ من المستحيل عليه فك تشفير النص المشفر‬، ‫• بغض النظر عن مقدار الوقت المتاح للخصم او المهاجم‬
one-time ‫ (على سبيل المثال‬.)‫بسبب أن المعلومات المطلوبة غير موجودة (المعلومات ليست كافية‬
) pad

• Computationally secure
• The cost of breaking the cipher exceeds the value of the encrypted
information.
• The time required to break the cipher exceeds the useful lifetime of the
information.
‫❑ آمن حسابيا‬
.‫• تتجاوز تكلفة كسر التشفير قيمة المعلومات المشفرة‬
.‫• يتجاوز الوقت الالزم لكسر التشفير العمر اإلنتاجي للمعلومات‬
© 2017 Pearson Education, Ltd., All rights reserved.
 Substitution Technique

• Is one in which the letters of plaintext are replaced by

other letters or by numbers or symbols.

• If the plaintext is viewed as a sequence of bits, then

substitution involves replacing plaintext bit patterns
with ciphertext bit patterns.

. •

© 2017 Pearson Education, Ltd., All rights reserved.

 (1) Caesar Cipher
• Simplest and earliest known use of a substitution cipher
• Used by Julius Caesar
• First attested use in military affairs
• Involves replacing each letter of the alphabet with the
letter standing three places (the key)
further down the alphabet.
• Alphabet is wrapped around so that
the letter following Z is A
plain: meet me after the toga party
cipher: PHHW PH DIWHU WKH WRJD SDUWB

© 2017 Pearson Education, Ltd., All rights reserved.

 Caesar Cipher Algorithm
• Can define transformation as:
a b c d e f g h i j k l m n o p q r s t u v w x y z
D E F G H I J K L M N O P Q R S T U V W X Y Z A B C

• Mathematically give each letter a number

a b c d e f g h I j k l m n o p q r s t u
v w x y z
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

• Algorithm can be expressed as:

C = E(3, p) = (p + 3) mod (26)

• A shift may be of any amount, so that the general Caesar algorithm is:

C = E(k , p ) = (p + k ) mod 26

• Where k takes on a value in the range 1 to 25; the decryption algorithm is simply:

p = D(k , C ) = (C - k ) mod 26

© 2017 Pearson Education, Ltd., All rights reserved.

 Caesar Cipher
• Example: suppose the key for a shift cipher is K = 11 and the plaintext is
wewillmeetatmidnight
• We first convert the plaintext to a sequence of integers using the
specified correspondence, obtaining the following:
22 4 22 8 11 11 12 4 4 19 0 19 12 8 3 13 8 6 7 19
• next, we add 11 to each value, reducing each sum mod 26:
22 + 11 mod 26 = 7
7 15 7 19 22 22 23 15 15 4 11 4 23 19 14 24 19 17 18 4
• Finally, we convert the sequence of integers to alphabetic characters,
obtaining the ciphertext:
HPHTWWXPPELEXTOYTRSE

Exercise: Try to do the opposite operation (decryption process).

 Figure 3.3

Brute-Force
Cryptanalysis
of
Caesar Cipher
(This chart can be found on page 75 in the
textbook)

© 2017 Pearson Education, Ltd., All rights reserved.

 (2) Monoalphabetic Cipher
• Permutation:
• Of a finite set of elements S is an ordered sequence of all the
elements of S , with each element appearing exactly once.
• For example, if S = {a, b, c}, there are six permutations of S : abc, acb, bac, bca, cab, cba

• If the “cipher” line can be any permutation of the 26

alphabetic characters, then there are 26! = 4 x 1026
possible keys.
• Approach is referred to as a monoalphabetic substitution cipher
because a single cipher alphabet is used per message.

© 2017 Pearson Education, Ltd., All rights reserved.

 Monoalphabetic Cipher
• rather than just shifting the alphabet
• could shuffle (jumble) the letters arbitrarily
• each plaintext letter maps to a different random ciphertext letter
• hence key is 26 letters long
‫بدال من مجرد تغيير األبجدية‬ •
‫يمكن خلط (خلط) الحروف بشكل تعسفي‬ •
‫يتم تعيين كل حرف نص عادي إلى حرف نص مشفر عشوائي مختلف‬ •
‫ حرفا‬26 ‫ومن ثم فإن المفتاح هو‬ •

The
key Plai n: ab cde fgh ijk lmn opq rst uvw xyz
Ciph er: DK VQF IBJ WPE SCX HTM YAU OLR GZN

Plai nte xt: i fwe wis hto rep lac ele tte rs
Ciph ert ext : W IRF RWA JUH YFT SDV FSF UUF YA
 Language Redundancy and
Cryptanalysis ‫التكرار اللغوي وتحليل الشفرات‬
➢ human languages are redundant
➢ E.g: "th the s m we sh ll nt wnt"
➢ letters are not equally commonly used
➢ in English E is by far the most common letter
⚫ followed by T,R,N,I,O,A,S
➢ other letters like Z,J,K,Q,X are fairly rare
➢ have tables of single, double & triple letter frequencies for various
languages
‫➢ اللغات البشرية تكرارية‬
th the s m we sh ll nt wnt" " :‫➢ على سبيل المثال‬
‫➢ الحروف ليست شائعة االستخدام على قدم المساواة‬
‫هو إلى حد بعيد الحرف األكثر شيوعا‬E ‫➢ في اللغة اإلنجليزية‬
S ، A ، O ، I ، N ، R ، T ‫تليها‬ ▪
‫ نادرة إلى حد ما‬X ، Q ، K ، J ، Z ‫➢ أحرف أخرى مثل‬
‫➢ نمتلك جداول تحتوي على ترددات األحرف المفردة والمزدوجة والثالثية لمختلف اللغات‬
English Letter Frequencies
 N-gram Frequencies
• Digram (Digraph Frequency)
– Two-letter combination
– Most common is th
– th he an in er on re ed nd ha at en es of nt ea ti to
io le is ou ar as de rt ve
• Trigram (Trigraph Frequency)
– Three-letter combination
– Most frequent is the
– the and tha ent ion tio for nde has nce tis oft men
20
 Use in Cryptanalysis
• Easy to break because they reflect the frequency data of the original alphabet
• key concept - monoalphabetic substitution ciphers do not change relative letter
frequencies
• calculate letter frequencies for ciphertext
• compare counts/plots against known values
• if Caesar cipher look for common peaks/troughs
– peaks at: A-E-I triple, NO pair, RST triple
– troughs at: JK, X-Z
• for monoalphabetic must identify each letter
– tables of common double/triple letters help
‫• من السهل كسرها ألنها تعكس بيانات التردد لألبجدية األصلية‬
‫ االستبدال أحادية األبجدية ترددات الحروف النسبية ال تتغير‬- ‫• المفهوم الرئيسي‬
‫• حساب ترددات الحروف للنص المشفر‬
‫• مقارنة األعداد بالقيم المعروفة‬
‫ قيعان مشتركة‬/ ‫• إذا كان تشفير قيصر يبحث عن قمم‬
‫ ثالثي‬RST ، ‫ ال زوج‬، ‫ ثالثي‬A-E-I :‫ قمم في‬-
X-Z ، JK :‫ أحواض في‬-
‫• ألحادي األبجدية يجب تحديد كل حرف‬
‫ الثالثية الشائعة تساعد‬/ ‫ جداول األحرف المزدوجة‬-
 Example Cryptanalysis
• given ciphertext:
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ
VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX
EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ
• count relative letter frequencies (see text)
• guess P & Z are e and t
• guess ZW is th and hence ZWP is the
• proceeding with trial and error finally get:
it was disclosed yesterday that several informal but
direct contacts have been made with political
representatives of the viet cong in moscow.
Homework: write program to decrypt above ciphertext
 Example Cryptanalysis (cont.)
• One alphabet frequencies: guess P & Z are e and t
• Diagrams and trigrams: frequencies of compound
letters → guess ZW is th and hence ZWP is the
• proceeding with trial and error
UZQSOVUOHXM OPVGPOZPEVSGZWSZOPFPESXUDBM ETSXAIZ
t e e te th t e e t
VUEPHZHM DZSHZOWSFPAPPDTSVPQUZWYM XUUHSX
e t t t h e ee e th

EPYEPOPDZSZUFPOM BZWPFUPZHM DJUDTMOHMQ

e e e t t e the et
 (3) Playfair Cipher
• Best-known multiple-letter encryption cipher

• Treats digrams in the plaintext as single units and translates these units into
ciphertext digrams

• Based on the use of a 5 x 5 matrix of letters constructed using a keyword or

without using a keyword.

• Invented by British scientist Sir Charles Wheatstone in 1854

• Used as the standard field system by the British Army in World War I and
the U.S. Army and other Allied forces during World War II

© 2017 Pearson Education, Ltd., All rights reserved.

Playfair without Key Matrix
➢ a 5X5 matrix of letters

A B C D E

F G H I/J K

L M N O P

Q R S T U

V W X Y Z
 Encryption
• plaintext is encrypted two letters at a time
1. if a pair is a repeated letter, insert filler like 'X’
Example: p= proof p = proxof pr ox of, if the number of
letter is odd we add another X right at the end to make it
come out even.
2. if both letters fall in the same row, replace each with the
letter to right (wrapping back to start from end)
3. if both letters fall in the same column, replace each with
the letter below it (wrapping to top from bottom).
4. otherwise each letter is replaced by the letter in the
same row and in the column of the other letter of the pair.
 Encryption
• Example if the message “the office did not jump at the idea”
• The first step would be to split the message up into pairs, as follows
TH EO FF …….
• Repeated letter ff and the number of letter is odd, the message actually
comes out as:-
• TH EO FX FI CE DI DN OT JU MP AT TH EI DE AX
• TH different column and different row replaced by the letter in the same
row and in the column of the other letter of the pair E(TH) = SI, E(EO) = DP,
E(FX) = HV ……
• FI both letters fall in the same row, replace each with letter to right E(FI) =
GK,
• E(CE) = DA
• DI if both letters fall in the same column, replace each with the letter below it
E(DI) = IO
• You get ciphertext SIDPHVGKDAIOCDTYKTNLDQCDDKEACV
 Playfair with Key Matrix
• Fill in letters of keyword (minus duplicates) from
left to right and from top to bottom, then fill in
the remainder of the matrix with the remaining
letters in alphabetic order.

• E.g.: Using the keyword MONARCHY

M O N A R
C H Y B D
E F G I/J K
L P Q S T
U V W X Z

© 2017 Pearson Education, Ltd., All rights reserved.

 Encryption
• plaintext is encrypted two letters at a time
1. if a pair is a repeated letter, insert filler like 'X’
example p= proof p = proxof pr ox of
2. if both letters fall in the same row, replace each with
letter to right (wrapping back to start from end)
3. if both letters fall in the same column, replace each
with the letter below it (wrapping to top from
bottom)
4. otherwise each letter is replaced by the letter in the
same row and in the column of the other letter of
the pair
 Encryption (cont.)
• Example P =welcome add x welcomex
• WE (otherwise each letter is replaced by the letter in the same row and in
the column of the other letter of the pair) UG

• LC (letters fall in the same column, replace each with the letter below it ) UE

• OM (letters fall in the same row, replace each with letter to right ) NO
• EX (otherwise each letter is replaced by the letter in the same row and in the
column of the other letter of the pair) IU

• You get ciphertext UGUENOIU

© 2017 Pearson Education, Ltd., All

rights reserved.
 Decryption
• Decryption process of course works exactly in reverse.

• In decryption process, the opposite movement will be applied.

So, instead of move right we will move left and instead of move
down we will move up.

• For example, UG (each letter is replaced by the letter in the

same row and in the column of the other letter of the pair) WE

• NO (letters fall in the same row, replace each with letter to the
left ) OM

© 2017 Pearson Education, Ltd., All

rights reserved.
 Homework
• 1- Try encrypt the message “individual
letters” without key.
• 2- Try encrypt the message “encrypt the
message” with key = STZVX
• 3- Try decrypt the ciphertext message
"SIDPHVGKDAIOCDTYKTNL“ without key.
 (4) Hill Cipher
• Hill Cipher is a symmetric block cipher technique
developed by the mathematician Lester Hill in 1929.

• Is a substitution cipher based on linear algebra.

• Strength is that it completely hides single-letter

frequencies
• The use of a larger matrix hides more frequency
information

• Strong against a ciphertext-only attack but easily

broken with a known plaintext attack
© 2017 Pearson Education, Ltd., All rights reserved.
 Hill Cipher
– Each letter is treated as a digit in base 26: A = 0, B =1,…., Z=25.
– The plaintext is divided into blocks of n letters (considered as a vectors of
n dimensions), and multiplied by the key ( n × n matrix) modulo 26.
– The components of the matrix are the key, and should be random
provided that the matrix is invertible (has an inverse matrix) to ensure
decryption is possible.
– If the block size is two (2x1), then the key matrix should be of size 2x2,
and the encryption process will produce ciphertext with two numerical
values

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 34
 Hill Cipher
• Encryption
– Assign each letter in the plaintext by an index(number)
- C = KP mod 26, where P=plaintext and C=ciphertext
- Matrix K is the key
- If P of size nx1, the key (K) must be of size nxn
• Decryption
- P = K-1 C mod 26, where K-1 is the inverse of the matrix K
-1 1 0
- K.K = I, where I= is the identity matrix
0 1
- Thus, we can decrypt iff gcd(det(K), 26) =1.
- We can decrypt only if the key matrix (K)has an inverse(K-1).
35
 How to calculate K-1 for 2x2 matrix?
Example: find K-1 for the
1 2
matrix K=
3 4

= (1x4) – (3x2)=4 – 6= –2

K-1 =
Hill Cipher

gcd (9, 26) =1

 How to Decrypt?
• Compute K-1
– Compute det (K)
– Check if gcd (det (K), 26) =1
– If not, then K-1 does not exist
– Else K-1 is
 ( − 1)1+1 K1,1  (− 1) K n ,1 
1+ n

  −1
     det( K )
 − 1 1+n K 
( ) ( ) n ,n 
−
2n
1, n  1 K

38
 Hill Cipher - Example
• Example: Encrypt the message “HELLO” by using Hill Cipher with
5 8
the key k=
17 3
• Solution: HE LL OX → 7 4 11 11 14 23
Encryption:
H 7
P1 = =
E 4
5 8 7 35 + 32 67 15 P
C1= = = mod 26 = =
17 3 4 119 + 12 131 1 B
HE → PB
Decryption:
-1 9 2
K =
1 15
9 2 15 135 + 2 137 7 H
P1= = = mod 26 = =
1 15 1 15 + 15 30 4 E
 Hill Cipher - Example
• Example: Encrypt the message “HELLO” by using Hill Cipher with
5 8
the key k=
17 3
• Solution: HE LL OX → 7 4 11 11 14 23
Encryption:
L 11
P2 = =
L 11
5 8 11 55 + 88 143 13 N
C2= = = mod 26 = =
17 3 11 187 + 33 220 12 M

LL → NM
 (5) Vigenère Cipher
• Best known and one of the simplest polyalphabetic substitution ciphers.

• Basically multiple Caesar ciphers

• In this scheme the set of related monoalphabetic substitution rules

consists of the 26 Caesar ciphers with shifts of 0 through 25

• Each cipher is denoted by a key letter which is the ciphertext letter that
substitutes for the plaintext letter.

‫العادي‬

© 2017 Pearson Education, Ltd., All rights reserved.

Example of Vigenère Cipher
• To encrypt a message, a key is needed that is as long as the message
• Usually, the key is a repeating keyword
• Use each key letter as a Caesar cipher key
• For example, if the keyword is deceptive, the message “we are
discovered save yourself” is encrypted as:

key: deceptivedeceptivedeceptive
plaintext: wearediscoveredsaveyourself
ciphertext: ZICVTWQNGRZGVTWAVZHCQYGLMGJ
• Decryption simply works in reverse
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
 Example of Vigenère Cipher
• EXAMPLE :- suppose m = 6 and the keyword is CIPHER. This corresponds to the numerical
equivalent K = {2, 8, 15, 7, 4, 17}. Suppose the plaintext is the string
THISCRYPTOSYSTEMISNOTSECURE
• We convert the plaintext elements to residues modulo 26, write groups of six, and then add
the keyword modulo 26
P= 19 7 8 18 2 17 24 15 19 14 18 24 18 19 4 12 8 18 13 14 19 18 4 2 20 17 4
CIPHER CIPHER CIPHER CIPHER CIP
key 2 8 15 7 4 17 2 8 15 7 4 17 2 8 15 7 4 17 2 8 15 7 4 17 2 8 15
---------------------------------------------------------------------------------------------------------------------
21 15 23 25 6 8 0 ---------------- (plaintext + keyword) mod 26

21 15 23 25 6 8 0 23 8 21 22 15 20 1 191912 9 15 22 8 25 19 22 25 19
The ciphertext: VPXZGIAXIVWPUBTTMJPWIZITWZT
• Decryption:
(ciphertext - keyword) mod 26
 (6) One-Time Pad
• Improvement to Vernam cipher proposed by an Army Signal Corp
officer, Joseph Mauborgne

‫ جوزيف موبورن‬، ‫• تحسين تشفير فيرنام الذي اقترحه ضابط في سالح اإلشارة بالجيش‬

• Use a random key that is as long as the message so that the key need
not be repeated

• Key is used to encrypt and decrypt a single message and then is

discarded (can only use the key once )

• Each new message requires a new key of the same length as the new
message

• Scheme is unbreakable:
• Produces random output that bears no statistical relationship to
the plaintext
• Because the ciphertext contains no information whatsoever about
the plaintext, there is simply no way to break the code
© 2017 Pearson Education, Ltd., All rights reserved.
 Difficulties
• The one-time pad offers complete security but, in practice, has
two fundamental difficulties:
• There is the practical problem of making large quantities of
random keys
• Any heavily used system might require millions of random
characters on a regular basis
• Mammoth key distribution problem
• For every message to be sent, a key of equal length is needed by
both sender and receiver

• Because of these difficulties, the one-time pad is of limited

utility
• Useful primarily for low-bandwidth channels requiring very high
security

• The one-time pad is the only cryptosystem that exhibits perfect

secrecy .
© 2017 Pearson Education, Ltd., All rights reserved.
 Example 1
Consider the ciphertext

Suppose that a cryptanalyst had managed to find these two keys. Two plausible plaintexts are produced.
How is the cryptanalyst to decide which is the correct decryption (i.e., which is the correct key)? Thus,
there is no way to decide which key is correct and therefore which plaintext is correct.
‫ كيف يقرر محلل التشفير ما هو فك التشفير‬.‫ يتم إنتاج نصين عاديين معقولين‬.‫لنفترض أن محلل التشفير قد تمكن من العثور على هذين المفتاحين‬
.‫ ال توجد طريقة لتحديد المفتاح الصحيح وبالتالي النص العادي الصحيح‬، ‫الصحيح (أي ما هو المفتاح الصحيح)؟ وبالتالي‬
© 2017 Pearson Education, Ltd., All
rights reserved.
 Example 2
If the key is "XMCKL" and the message is "HELLO", then the coding would be done
as follows:

The ciphertext to be sent to is "EQNVZ". To decrypt the message, the same process,
but in reverse, is applied to obtain the plaintext. Here the key is subtracted from the
ciphertext, again using modular arithmetic:
 Steganography

© 2017 Pearson Education, Ltd., All rights reserved.

 • Character marking
• Selected letters of printed or
typewritten text are over-written in
Old pencil
• The marks are ordinarily not visible
Steganography unless the paper is held at an angle
to bright light
Techniques • Invisible ink
• A number of substances can be
used for writing but leave no visible
trace until heat or some chemical is
applied to the paper
• Pin punctures
• Small pin punctures on selected
letters are ordinarily not visible
unless the paper is held up in front
of a light
• Typewriter correction ribbon
• Used between lines typed with a
black ribbon, the results of typing
with the correction tape are visible
only under a strong light
© 2017 Pearson Education, Ltd., All rights reserved.
 ‫❑ وسم األحرف‬
‫‪Old‬‬ ‫يتم كتابة أحرف مختارة من النص المطبوع أو‬ ‫•‬
‫المكتوب على اآللة الكاتبة بالقلم الرصاص‬
‫‪Steganography‬‬
‫عادة ما تكون العالمات غير مرئية ما لم يتم تثبيت‬ ‫•‬
‫‪Techniques‬‬ ‫الورق بزاوية للضوء الساطع‬

‫❑ حبر غير مرئي‬

‫يمكن استخدام عدد من المواد للكتابة ولكن ال تترك أي‬ ‫•‬

‫أثر مرئي حتى يتم تطبيق الحرارة أو بعض المواد‬
‫الكيميائية على الورق‬

‫❑ ثقوب دبوس‬

‫عادة ما تكون ثقوب الدبوس الصغيرة على األحرف‬ ‫•‬

‫المحددة غير مرئية ما لم يتم رفع الورق أمام الضوء‬

‫❑ شريط تصحيح اآللة الكاتبة‬

‫تستخدم بين األسطر المكتوبة بشريط أسود ‪ ،‬وال تظهر‬ ‫•‬

‫نتائج الكتابة بشريط التصحيح إال تحت ضوء قوي‬

‫‪© 2017 Pearson Education, Ltd., All‬‬

‫‪rights reserved.‬‬
 Steganography vs. Encryption
• Steganography
has a number of drawbacks
when compared to encryption
• It requires a lot of overhead
to hide a relatively few bits of
information
• Once the system is
discovered, it becomes
virtually worthless
‫❑ إخفاء المعلومات‬
‫له عدد من العيوب عند مقارنته بالتشفير‬
‫• يتطلب الكثير من النفقات العامة إلخفاء‬
‫عدد قليل نسبيا من المعلومات‬
‫ يصبح عديم‬، ‫• بمجرد اكتشاف النظام‬
‫القيمة تقريبا‬
© 2017 Pearson Education, Ltd., All rights reserved.
• The advantage of
steganography
• It can be employed by parties
who have something to lose
should the fact of their secret
communication (not necessarily
the content) be discovered
• Encryption flags traffic as
important or secret or may
identify the sender or receiver as
someone with something to
hide
‫❑ ميزة إخفاء المعلومات‬
‫• يمكن استخدامه من قبل األطراف التي لديها‬
‫ما تخسره في حالة اكتشاف حقيقة اتصاالتهم‬
)‫السرية (وليس بالضرورة المحتوى‬
‫❑ يشير التشفير إلى حركة المرور على أنها‬
‫مهمة أو سرية أو قد يحدد المرسل أو‬
‫المستلم كشخص لديه شيء يخفيه‬
 Summary
• Symmetric Cipher • Substitution
Model techniques
• Cryptography • Caesar cipher
• Cryptanalysis and • Monoalphabetic
Brute-Force Attack ciphers
• Playfair cipher
• Transposition
• Hill cipher
techniques
• Polyalphabetic ciphers
• One-time pad

• Steganography

© 2017 Pearson Education, Ltd., All rights reserved.