Information

⇐y
GEM VII
csEB_
 INFORMATION SYSTEM SECURITY
17/8/21 -
- -

¥-7
- -

Information Security
Mechanisms .
: -

c
l 1
Old New
Is

ty Attacks a

a- I
A

%
Threat Threat
Threat
to to
CIA Tried
availability
→
two &
→ To introduce concepts cryptography
-

stenography .

90¥
CONF1DFNTlAU#2
should be available to authorised
only
Date made user .

Sensitive data should not be evident to public .

SECURITY

÷g÷:q
No
changes
to data
www.ew-i during
should
happen the transmission

n-vn-n.it?s,fij#yrnorbursternI.Pynources
There
should
should be not
be
always
any
available
dental
of
to authorised
Sirna / debt resource
us css .

①
Elements
of Information
Elements ( Security
Guard Camera
-2
Access
Rights)
Physical , .
Rzone
Downloading
, ,

② System Elements ( Antivirus ,

Malicious slw detection soli disable
,

USB posts) .

( Authorised Control
⑤ Process Elements User / Access ,
slw details
log ,

entry )
 gagyyayn.gg

→→ U

|M0DlFlCATl0N → A

f |TRArf
← ANALYSIS
lmasaue.am#JsA/FtIIL-ETA Threat to
A
THREAT TO
1Repµ# Availability
.

coNFIDENTIAL.IT# fREPUDIA.to#-
Threat to

Security Sonics

↳Épdmety .

↳Date
Integrity that
↳ Anthenticetion assurance
cannot
↳ Non Repudiation Someone
the
validity
↳ Access Control deny
of something
.

Repudiation
denial
of
→ truth or

Tidily of someway is
something
of claiming invalid
that
ie act .
 Entry
Attended
PaÉ .
Ad-teAeta

¥9
↳ It attempts to 9T
attempts to alter
system
resources / info
of
.

the
learn or
make use

↳MAsQUERNG when
system
- one

info from
the

" " ~
Fatwas
.

does not affect

the
but
's resources
system
ofmenagei.ee
↳
.

attacker will
only
see
some part is altered
message will not ofis
the data but
it
or
message delayed
modify ↳
Replay involves
.

passive capture
→

& 't
difficult ofretransmission
its
Passive Attacks to trnbsqueu

¥-0k
menage
are

to
produce
an
detect .

undesired
affect
-

service
of → It
prevent
normal use
of resources .

Attacker
generally generates numerous

that
fake inputs Inquests
so
make
serves and
to overload
the

it unavailable for genuine

user .

=
Security Mechanisms
They
are used to
provide security .

①ENClPHERENT_
date into
The use
of mathematical algos to
transform a
form
that is not
readily intelligible .

PIAiNTE✗T→C1PHERTt
② DIGITAL
-
SIGNATURE
which sender
is
by electronically sign the date and
can
gt means

the receiver can

electronically verify the data .
③DATA1NTEGR date
Its like checksum that has been everted
from the
received
from
the
creates new checksum
The receiver
a

itself
.

date and compares

the
newly checksum with
previous
maintained
checksum .

deter
integrity
was

quel
.

then
are
both ,

of
④
AUTHENTICATION
this two entities exchange some
messages
to
prove
their
identity
other
to each
.

⑤ TRAfFlCPADD1N#
extra / bits with the date

gn this technique
we add some
dummy
while encrypting .

⑥ R0UT1NGCoNTR# available route

and
continuouslyprevent
changing different
selecting& receiver
means

sender the from eavesdropping

to the attacker
b/w the

route
a
particular
.

on

⑦AccEssGNTROL_ date
light to the .

that a user has access

These methods prove

⑧ NOTARIZ.AT# communication
to control the
third trusted
Means
selecting a
party
This be done to
prevent repudiation
.

can
b/w two entities .

-
 Tt-RMINOLOGIPMIYag.ie#nt is
going to be transmitted or stored is
plaintext .

FNCRYP9ON_2
method which
The
by can hide the
plain text .

E- (m ) -
-
C

%IY?gencryption ✓
-

t.IE?tYoI?# obtaining original meaning of ciphertext .

☐ (Elms) - M

É÷t piece used

for encryption
&
decryption
of info
-

cRYPTANAL
Science
of retrieving the
plain text
from cipher without
knowing
the
key
.

cRYPTANALY#2
PEOPLE who
perform cryptanalysis
-

Applications of cryptography a
Electronic
ATM E- commerce
voting etc .

,
, ,
 Classical Encryption Techniques
csymmetnc
↳ Substitution

↳ Transposition .

Substitution Technique

{
Transpyoñtinyiphers ↳ Caesar

↳ Mono alphabetic
keyless keyed Mitre
poly
↳
alphabetic
↳ pTaÉvernam
↳ till

↳ One Time Pad

-
 Classical
- Encryption Techniques a
Symmetric Encryption Conventional Encryption)

-RADNAL
SYMM-t-RC-KEYCIPHERS.tn
Be

Same
key for Encryption &
=
decryption
P plaintext
cryptiou
=

c-

K
-

-
-
ciphertext
key
plan
Encryption :-C =
Edp)
(C)
Decryption :-P =D ↳
,<
Decryption

DKCt-KGD-EID-ax-k.CAT#0REQFTRADlT10NALCiPHER- I

'°Y{
✓
2 basic build ↳
Substitution
↳ Transition,
Cipher → No
replacement do permutation
we

(Transposition cipher
blocks
of
all -
,

Mon alphabetic →onetÉ

the
encryption
techniques .su#iNCePHER-/-Polyalphabetic- → one to
Mary
.

replaces one
symbol
withanother
I .

C
Single cipher char ←
Moz Ey → F- hello ;
=
KHIQR
each chain
for &
plaintext Addetivec.ph#(shiflCipher)CCaesar-ipher&-
Plaintext k l
b d
f g h
j
i t
→
a e m n o r s v v w
e

p q
P O V w
ciphertext D F M N O RS TU
→ A B C E G H I J KL
value → 0 I 2 3 45 6 7 8 9 10 11 12 13 141516 17 18 19202122

✗ z
y

Shift key
✗ Y Z

for Encryption as zu as
is deiaed by the

- used .

held → Use additive cipher to convert

Eielp )=(Pe☒k 7%26

.C=(P-K)mod26p
|p=D☒(Pµk)%26
c- -

I t

text my
 & then take
Sf C -
K is -
re
,
then add 26
first
N0 mod
-
.

Multiplicatueliphera
Encryption
→
c=(P✗ K ) mod 26
=(CXK ) mod 26 Decryption
" 49
p →

¥
h e 11 o k = 7

:| '¥¥÷÷÷÷¥
✗CZZU-
l 11×7=77226--2
0 14×7=98%26 = U

Affiue.ci/herT- (p÷
xk,)%26c=(T-kz)%26/P- (TXkT)%26 7- G- KD 7.26
→

→st#
Steps

& hello
key =(a.
2) ?¥¥
ZEBBW__ : :
(231-2)-7.26

{
h = 7 ✗ 7--23 → ✗ = 25 = Z
4×7--2 c
(2+2)%26 4 E
Encrypted
=
e → = =

(25+2)%26 =
'

1--11×7=25→ 2 =
1 = B
l =
25-2
11 ✗ 7 =
(25+2)%26 =
I = B
0--14×7=20 → U
(20-12)%26 = 22 = W
?⃝
 playfiera.ph#-
↳ Invented
by Charles Wheatstone in 1854 . Named
Lord
after Playfair .

Al90RHHM_→ ① Create 5×5 matrix that is called

grid of letters .

② The of key 4
theinserting
it
guest
matrix the
made
into
by values

lemaimty alphabets matrix .

g.my of ←
→
right ) where
,
cuter I & J will

ways toy be combined

together
.

Giver ③ Convert the text into

poise of alphabet .

wdÑÑ Ñ
A
G → HEY A → He Ya

insert ]
air a) pair cannot
letters into
be made
&
with same letter

previous
.

letter
Break the

renown
single
'
add X' to .

of b) of is
the letter
standing with
alone in the
process
"

alphabet of pairing
'

then add
'
2 the letter .

G → Hetdoe
→ He ex lo ez

Hex
Ey
→
→ ✗ o e He ✗2 ✗0 ez

↳ Now ✗ is
already
used

so we use 121 .

⑨ Code will be
formed using 3 rules a

1) Of both the
alphabets are in the same now , replace
with to their immediate
them
alphabets right
.

ii of both
in bolt ,
replace
alphabets
the are same them
with below
alphabet immediately them .

) of
iii not in same row / col ,
replace them with
alphabets
in the
corners .
same row
respectively ,
but at other
pair of
 ly of Playfair
'

,↳→'tAB

11
"

let Plaintext ,be,

_1÷→TÉ-R
& M are in some
ol ? so ace .
to
ago we
B

occurring immediately
below each
the
element
take
i. B &M .

cheer e

Now glucosides P= RW →

c=ñ in sow so we
take
FIG are
same

p F G chap
right
=

immediate
.

c = § &
p = UQ

§I%wne so
for Q we
not

look
in
for
some

element
insane colas W
-
whole
in its

c. = R v now that occur

W
& thing
we do
for
.

same
 Vignere Cipher
→ It is a
poly alphabetic Cipher .

( 16th French
→
designed by
Blaise de
Wigmore Century
M°a%u)
Encryption
matrix
using ( vigneve.la#
is done 26×26

Give
Ey Plain text
Money
=
→

hey =
L0#
so

repeat
the
key
E.EC/YE/MYtI/I/I--astofiuwe
to
we
need "'
" '

"

Plaintext →

"
t

P &K &
Now we do Intersection
of elements .

we
get
gs '
a✗ L
¥
=
R EXK = 0 the
cipher for .

p
MxL=✗ web chat in p
1×0 = W
0×0 =C
✓✗C = ✗
 Method2-
→
W/o VdgneveTab

bing.t o?-pi+ki)%262ODeoyption- Pi=(Ci-ki)7.26

①

sheislisteuingh.bg
"

G→ Plaintext =

=
RASCAL
is the numerical value
The
key
stream
of key
.

key stream →

PASCAL
6150118720€
"

¥kF-±°"①w sµsµµµa
" +
"

(
°
" "" " "
&
°
°

P value 18 7 4 8 18 11 8 18 19 4 13 8 13 6

" " " ° " " " " °

C' 7
vqff.ge it 2210 18 222318 11 6 13 19 2 6

aim .

↳(15+18)%26 =
33%26--7
?⃝
 vernama.ph#
Cipher

polyalphabe-iecipher-EKIxt-E-y.ly
substitution &
Type of

P = RAM SWARUP K
→

K =
RANCHO BABA

÷¥÷:÷÷÷:
→ R A M S W A RUI P K

17 0 13 2 7 14 I 0 I 0
"

34 0 2520 29 14 18 20 16 10
Ptk →

If > 26 8D 0 25 20
3d 14 18 20 16 to
p(+1-7-26 d
d d d
Cipher I A Z U D O S U Q K ←
Ciphertext

for decryption , Ci -

Ki
ki ) -126
& Ci < 0 then Pi ( Ci
of Ki
- = -

Hill Poydphabette
cipher
→

developed by Lester hill called

→
1929 in .

( like
encrypts group of
letters a
polygraph playfair ,

( group of 2 letters) is called

encryption
in which
playfair
does
pair
'

digraph
.

To
encrypt Kp mod 26

Stg# ( matrix
key key
matrix
→ choose a must be
spare
:]
' '

( wI [I
v
view i
any key
we can take →

e-

( Matrix)
dimension
of key Synan
we
the

depending
Now on ,

the size
of polygraph into
.

choose
ten
of m -2
-
then pis converted vectors
of
 NIT-wyp-h.mg
Eg Plaintext ATTACK
=
→

key [ 7
-
-

3 G- 2×2

Since ma 2
,
! .
we have
(F) .gl?A)zxi (E)
↳ 2×1

1st vector →
(F) =L :]
& 3) [ ;] =/÷;] 7.26€ 1%26
c- -

( KP ) 726
,

=L:] I:]
24
(F) (f)
=.

vector →

c-
§ :X:] -1¥:]
=

1%-7%26=157
3rd
-1¥
vector →
(E) →
]
c-
4:11 :] -1¥ :÷i%↳ -1%1%26
-

-1%7=1 :]
-

Ciphertext =FkMFI# Any

Decryption I
KEPT →
Determinant
of
D=
Matrix

/ ad -
D=

bet
/ { bd / "=ÑaF Eminent

g→ da
/ } } / =/ 2×6-3×3
/ =
±
Inverse
find multiplicative of
Now determinant .

i. e
dd"=d26_ (identity Matrix )
 :÷÷
1
3 ☒ d-1=-1 mod 26

'
So d- =D
- Now d-
I
should be such that
@ ✗ d -7%26
=I
Another Example d- =D
needy
, as

5 ✗ N I 1 mod 26 3X9=27%2
↳ 27 cannot be
achieved

④ here .

not done
26×2 = 52-1 1=53 also

26×3 = 78 -11=79 .

10¥
'

26×4=104-11 =

Now
for adj ( K)
let A
=L ? I ] teen
adj (A)
=

[I -1 ]
=L! I]
1<=1} 3) Adj G)
signs
Before desyptuin
have to remove ve
- .

we

+26
] off %)
→

i. adjlk) =/ ¥2s 2 ,

K' adjlk) 1kt lady 'k

'
=

Now
¥
=

6
'
K
d- ay
.

( ] Kt
5h 207

9/6
23
]
=
= =

23 2
207¥
"

deypt
k
Now wing
C =
FKMFIO -

-
7%26
-

/
-

PE
(E) =/ I ] 7) 7.26=13%-1%26
(F)
" •

i:]
=
-

+
is =
 ⇐
1:14 :]

&
÷] 7) "⇐
[ I] (E)
(II.
-
-

E-

=P,PzP# Attack
=

Plain Text

↳
-

I N 9 8
:
13
:]
6

Plain Text should be contested into lay 3 vetoy

sse
ges
Saf
eine

IE:]
its;) -1¥ ] 1¥
a-
E. ¥71:)) :
-1¥: 1% -1¥;) "
" "
7×181-17×5

1%1--1*1
=

frÉ&y
.

and so on
 Decrypt →
(k"c)mo#

nil: : :3 7 4 17

1) Determinant
:( : :/ =4 1- 1:11 -1*1 : :|
" "
•
D= 17
7 4 13 16

"

of
Snore d i. ed
Now find Mul .

d ✗ dt I 1-mod 26

For
Adjck) ,
T

[
+An An
)=
adjlk
-

Az ,
-
+Azz -
Are
+
As , Asz +As}
-

8/8 /
15
A> =

7/8 /
15

%/
Asi
21,43
All
'
= ' y 17

13 16

/
15

13/2
=
Asa

4/2 /
15 17
Azz=
?/
A' 2=8
/ 7g
7

, 8 16

Ab
16/2 81
A↳=17
/
-

Ali
151¥ %) /I % 7- 4

Then Kunene
-
he Signs by adding26€
 TRANSPOSITION TECHNIQUES
←
) replacement of
chars
i no

Rearrangement of
the character 's
position
i. e
permutation on the

letters
plaintext
.

① Rail
-
Fence technique
is
gn this plaintext written down as
sequence of
a
the

off square of lows

.

seed
.

diagonals
an a
and then

}keyI①
'
best
for
"

eg
→ au un exams

¥-4444: Is
F RX M LTE ETO EAS
C = A LHBS

shoot
used
for messages
to attacker
by
break the

easy
.

Cipher
② RonspeÉin
& read
rectangle byorder
now the
write the a now
message ,

col
by permute
at col but the
of
message off
.

Value (
Unique digit from 9)
key Integer
ke⑧
→ 0 -

p→?*?¥÷→E→ am

::::H
// /
in

t e
by
° s o n

replaced
p e t
d u n t i to
be as

uniform
so
×É_
" ° a m can
any bits
1. 6 dummy the
box
ODWCOZX
Cipher → TTNA APTM TSU 0 A
make
K N LY PET 2

{ key decide the permutation of col nos }

Doubletranspositim
columnar transposition / transposition
Row
→

twice
applied
.

be
cipher can

in 2 een be sane
/diff
key
The case
.

Transposition Techniques
t I
kyed@
☒s
 Stream and Block

Tipher - -

used to convert
plain text →
cipher text

① s Cipher
digital bit 1
It is the that
encrypts data stream
one a one or

time
byte
at a .

(1

forhy-iwdeoypt.i n/BitstreemY
gt is
symmetric key cipher key
-

* a

Yj÷
generation
algorithm
Generations

kissogram ,
bitstream>
d*: Plain Text
Plain → ⑦ →
cipher -
→
→

Text

Text
②Ipner_
is treated whole and used
am this a block
of plain text as a

text
to
produce
the
cipher
I ☒k b
\ / 1-
☒
t
Ii
GofBbckCiphes_2
DEs(64bitblocksiz#
?⃝
 Difference -
b/w stream & Block
-
Cipher
STREAMB.LI
bit
byte of plain text 1 is
by wing
I
P → C blocks
of plain or

text
converted cipher to .

8 bits
It uses 64 bits or more at stream
cipher uses

a time .

is Stream cipher in more

complex
cipher
,

Complexity of block

simple .

It only confusion concept

.

uses
It uses
confusion as well as r

diffusion concept
.

text is
2h this decryption on hand .

Reversing
the
encryption
easy
, .

ECB ( electronic Code )

Block CFB ( Feedback)
cipher -

( output Feedback)
cis c.
Cipher block
chaining of 13

algorithm used
used modes
modes
-

algorithms
.

are

-
 Shannon
Theory of confusion &

DiffwÉ
-

The terms Confusion & diffusion were

introduced
by ctaudeshannon
.

Concern
cryptanalysis
to based
Shannon's prevent
was on
→

statistical analysis .

statistical
Assume attacker
knowledge
has some
of the

of plaintext leg frequency

the
characteristics in
message a ,

various letters be known

distribution
of the may
.

If these statistics in
any way reflected
are
in the
ciphertext
cryptanalyst may
deduce the
encryption key
.

the be able to

Shannon
suggested 2 methods a

properties for creating cipher

}
① confusion a sense

②Diffusion
DlFFUS.
several
symbol plaintext is
changed
in
words
if
the
9m
simple
,
a

will also
all
symbols in the
ciphertext change
.

or

of diffusion
→ The idea is to hide the

relationship b/w ciphertext and plaintext .

CONFUSION
-

It hides relationship b/w a•phIthe_ey

the
.

Race bits
of
ciphertext
is +most
dingle bit in
changed
their

of
a

be
key
will
changed
also .

that each bit

of ciphertext should dependent be

Confusion means

on several parts
of key ob-suumrinftheconneetimblwtee.to#
the ,
 FESTAL CIPHER STRUCTURE
=
- -

this structure
Most
of
the block
cipher technique uses .

1 .
Plaintext is divided in 2 halves
leg ↳
say → Lo & Ro

through of processing
H sounds
of data
The 2 halves the
→
pass
block
form ciphertext
.

and then combine to the

→ On the
right half apply fmri
we a- and in the
fund we

key generated from

the master
key
.

use a sub
their
with
left half
and
/p is ✗
this 0
Red then
The 0
of
olp will be swapped .

in round
This happens single
.

will there
depends Algo
-

N rounds be on
→

Blocksize →
Larger block size = More
Security
key
she scanty but

hanger
means more

Kceysize
→

lesser
algo speed
.

rounds secure
No.ofnds
→
more , more

( sub key) ✗
Security
complexity ( Funen )
complexity
✗
Seaoity
General
Depiction of
DES_

Single
Routed
Prices
 inside Box ?
What
-
happens - Expansion -

32 bits divided into 4 bits .

①
0¥
blocks .

For each block ,

9 bits are

converted to 6 bits .

Im]I 2- 5 6

First bit comes

from the

last bit ( of 4 bats )

of
the
previous
block

6th bit
from
comes
the
first
bit ( bits) the next block
of
4
of

The Expansion Cts bits> in

output of
Box

98 bit
with
key
.

✗0 Red
And then the result
of ✗ OR operation
5-Box which
is
passed on to

to 32 bits .

converts back

&

Binary of 9 (thus we are able

to select 4 bits )
→
 COL No →
0 I 2 3 4 5 6 78 9 ' ° 11 12 13 1415

:{ Row .

¥¥
 eytrans formation
( for ?
)
generated
How 16 16 sounds
keys
sub are
•

bit which YP to Pc -1

originally key
We have 64 as an
→ go
off
@ermuted
-
Choice -
1) and we
get
as 56 bit
key
.

%sPde a

is dinded into 8
parts
each
of 8
btts(D
64 bit
key
(1234567--80) TÉ- -
-
É÷
last bit is discarded (8%7) from each blocks

bits
Remaining
i. → 7×8--56
-

OIP of Pcl → 56 bit

key
(
)(a£§;)
bits
2 halves
of
is into 28
divided
key
This 56 bit

Now these bits are

shifted ( left> in each sound .

In Round It 1
, 2,316
→
shift by 1 ( circular left>
Dm other rounds
,
two halves circular
shifted by 2 .

Pc -2 ( Permuted choice 2)
bits to
Now these 56
shifted goes
'
selected
& 9812¥54 are

table
bit
using predefined
.

%sPde ,
56 bit → 48

sound
repeated for
so as
each
This whole is to be
process
each round
to
get lay for
.
 Double DES
-

is to brute
DES attack vulnerable
force attack due to

& distributed
increased
power of parallel computing .

introduced
÷ multiple-Time
.

-64 bit Plaintext

I
It used 2
different keys
.

follows DESCiph.es#
Double
Encryption occurs as this is
normal
c
I
P→ ECK , , P ) ,
bit Middle Text

ÉDEs
Des 64

C=E(k<,E(kn- process f
cipher
for I
decryption ,

Ciphertext
-

|
kafirs
"
is done 't
1
decryption using istheer .

The 64 bit Middle Text

Plain Text
" "
Thin Ttt I
"
Y
↳ Desoemree.ph#
-

µ →

in
Text
64 bit Middle

Middle 9
Meet in the
k→DESRevesseGphJ
Attack in
ciphertext
-

this attack involves

encryption from 1 and
end

matching
then the

decryption from
the other end
and

sesultsinrthemiddle
.

Plaintext
This attack requires attackers
knowing
some
pairs of
& ciphertext
-

µ
encryptP pain of Ciphertext
using ↳
decrypt using ki possible
all all

£5b possible values for 14 "

a values of
both side start match
After getting from
we
results
There be more than one common
may
values in the Mutt table .

all
So
cryptanalyst
needs to
toy for
ki&kz
matched pairs of
.

It takes twice as much as to break

Keye
there two
DES
style
as are .
 -
Triple DES

2 used
keys
→ or 3 .

→ more secure than double DES .

64 bit P T
6410917T€
1-
.

to
p
PDEs

}
k, →
cipher keys here

I need to K, →/ DES Reverse

cipher
be
diff .

4
(
DES Reverse
otherwise
kz →
cipher we end
up kz → DES
cipher
µ getting
'

←meH# q
ki
→
DEsciph k×→
DES reverse
cipher
d
T
64 bit
cipher -

Gy bit
Cipher Text
Text

2k⑦
Encrypting Decryption
64 bit Plaintext

t 64bit¥
k
,
→ DES
cipher K →
,
DES reverse
Cipher
to T
k<→ DES reverse
Cipher ←
DES
cipher
to T
DES
cipher
cipher
→
↳ DES reverse

to ↳→
T
Ciphertext
bit
64
Ciphertext
Encryption using 3
keys
.

Decryption using keys

3 .
 AÉEENCRYPT10NSTAN_DARD
(AES )
=

symmetric key block cipher

→

( National Institute
→
established in 2001
by the U.s -
NSIT
of
Standards &
Technology)
-

→
Fixed block size or or 4word#

÷":÷÷÷: High gk→o bit Plain Text

10 128 128

☒ 12 192 AES 192 version o

Pre
to

gÉÉ①-
-
sound
agg
Transformation
t
N0TE_ lword=32bits_ g- #fRound①
→

t
No .

of keys generated by key → Round ,

expansion --N# :
state → ( 4×4 matrix> I
bytes
§±•uaµ→÷a
16

↳ stores immediate result

is
diff

|
.

( 4×4=16 total from rest .

gnput Array
"
bytes in sounds

☒I 128bil-G.ph#extrsbyte
no
u

keys
state.tt#Y?YwSij wood no
→ .

v42 1^13 44 words

↳Hk
, -

Soo So , 5oz 503 k ki } in

ki ks , case
of
Sio Sli B 513
, -2 Kz K, K ,o 14g LO rounds

Sao 521 522 523 K, K K Kis AS h =D

, ,
,

Sso Ss , Ss Sss ↳ expand key

so no -

of
keys =p /
,

Wow , Wzhf - -
- - -
WWE
9m
decryption , round
Keye are
applied in reverse order .

→RÉ_
 TRANSF0RMATlON#S I

① SuBSTlN_

using
substitution But here
only
AES uses s -

Boxes .

one 5-BOX

for transformation of bytes

is used .

Sf
2
bytes are same , then
transformation is also same .

£ubByteS_ -

As we know in state
Array each cell consist
of 8 bit

Cibyt
hexadecimal
digits
We 2
interpret the
byte
as

1st hexadecimal
digit Row
} In
→
substitution
2nd hexadecimal a u
→
COLUMN
Box

S -
Box size =
16×16 Matrix
( Row &Colt) have
16 bear hexadecimal digits rangeof

② shiftRows_ Jn this the

bytes
→
we
permute

Leftshiftingisdone
→ .

No
of shifts for each Row in state
Array .
.

Row 0 →
0 or No
shift
byte shift
Row I →
1
Row 2 →
2 y
u

Row 3 → 3 a a

9m
decryption
&
g
we use oonverse
Shifting (
Right)
of shifts
no .
remain same .

③ Mi×C0LUMNS_

UP OIP ShiftMatrix
Rows
Transformation
of
→

is
There a constant
of 41€ .

Take an Cootie 4 matrix state

Array
wood
Matrix bytes or 4×1
from
and
multiply with const -
.

The Otp is 4×1 matrix which is stored in OIP State

Matrix .
⑨ kEYADD$NG_
time like mix
It also
transforms 1 word at a

Round 2
Add
key Coen

I / P → olp
of
Mix coin / Take 1 word Got ↳ and ✗ OR
Round
it with

key
corresponding
word
of
4×4 Matrix
⑦ z Ws → -
↳ This serves as

UP for next Round

Final Round this

and
for
will be treated
.
as
16
bytes
 BLOCK CIPHER
MOTTESOFOTTERATIONS
-
- -

5 modes
of operation are :

)
i ECB → Electronic Codebook Mode
ii
) CBC →
Cipher Block
Chaining Mode
iii ) CFB →
Cipher Feedback Mode
iv) of B → Feedback Mode
Output
v7 CT R→ Counter Mode

ECB__
*
Simplest mode
of operation
is divided into size block
*
plaintext a no
of fixed
.
.

*
of messageblock
is not a
multiple
time and
of block size then ,

padding
is done .

Take it
encrypt
* one at a
.

* same
key used
for encryption and
decryption .

Block Size
Eg Let 5
→ =

"
Plaintext
Everyone
"
→
Hello

Heeled
IEveryT-tonexy.TLpadding
6
pbinbÉtµcyptonAf# →
Cipher Block 1
Not secure
for lengthy data .

CB#
drawbacks
of
* Overcomes ECB

* Up to
EncryptionSo Algo is ✗ OR
of
current Plaintext Block and
preceding
cipher Block
patÉÉEd
.

Same
key for -5¥ .

Iv Initialization Vector is used in 1st

Encryption &
coypu)
→ de .

( Isreceiver
and should be known
for both
parties sender
 CFI

is Initialization vector ( w)
* There an
of b#ts .

The
plaintext is divided into
segment of s bits .

Cscen@eanyva_lueJ.g The b- s
first
bits are loaded

o-s
into
1
shift Register and a

+ shift Register left shift is done then

f
' '

b- s s s bits
from ciphertext
key →
E/ ncrypted f
Block is bonded .

d output
÷ÉPÉ
Encrypted & soon
d
¥4
☒→④ →
s bits
z→④→KD
d ]
N0tEMz→ on both
Encryption &
decryption ,
we use
Encrypt algo only .

bits
decryption
and in also
taken
four cipherBlock only
s are

C'S&P's
For
decryption only interchange
,
we can the
position of taking
ab
of
care
.

OFB
→

is
everything
OFB ,
An
only Block
difference being
same as CFB that
's bits
'

from ciphertext
instead bits
of loading
s we use
,

/ P of Encryption algo ( the 's bits which

generated
'
as an 0 .
we select
to
pesfor ⑦ operation .

CTR__
→
Simple and Fast
size Plaintext Block is used
a counter
equal to
of
→ -

→ counter is initiates ed with some value & then incremented forever

subsequent Plaintext Block kouuLe# c/ ountered
& d
→
Encyw ¥ Energy
key
Same#d PI →
a

⑦ → a pz
a
→
⑦ → C2