0% found this document useful (0 votes)
68 views51 pages

Module 4

The document discusses encryption and message authentication techniques, focusing on public key encryption and the use of Message Authentication Codes (MACs). It outlines the steps involved in encrypting messages and verifying their integrity to ensure they have not been altered during transmission. The document emphasizes the importance of data integrity and the role of cryptographic algorithms in secure communication.

Uploaded by

RITABRATA DEY
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
68 views51 pages

Module 4

The document discusses encryption and message authentication techniques, focusing on public key encryption and the use of Message Authentication Codes (MACs). It outlines the steps involved in encrypting messages and verifying their integrity to ensure they have not been altered during transmission. The document emphasizes the importance of data integrity and the role of cryptographic algorithms in secure communication.

Uploaded by

RITABRATA DEY
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

SYTANY

#
receiver

ke

iti
Klif
a &

TP
Go Ene

↓ -

ki

Et - eup
is

symmatic
technique

-
receive side
,
&G
3) sender
to

used a
by
message
(E N) is
,

key
(public encryption

D w)
,
issecret my
receiver ata
STEPS
pagea
,

decides
:
sin (at)
E and sends sender

Nepal
to
calculates
receiver now
Se4 : >

with

si((t < P(N))


-
also (E coprime
-
is

a
share
must notcommon facter
(E ,
N)-
any

not sharefactor
(E, P(N)) must
-

·
-
neve i
Et

still
-

painext winga
te
#encrypt -2
: PT =

- eg
14
c = 2 mod
= y =E

receiver darypts
message mings :

7 :
Step Y

= mode
-
C-

pt E = (4) text
E-plain
: (T =
eg
=
-
=
14
= <"mod
P(N) used for calculating
↓L
D
< &(N) a(n)
becoprin
/
should
It
XEmodd(Ni
= 1
MAC /Message
Authentication Code)

- public
internet
ronk
ET & ciphertext oth o

sublicke O private
Iponk
-
locked mirya
I
read
change
destroy
edit

he/she
can can
me
> no
malicious-
-

is
intention
>
-

message hasn't been changed


the
verify
that message
do, I
~ how

message authoritim a
col

A both sender & Receiver


>
-
Data

integrity

r
iTressage Idata is not

charged by

i
un
auth
person)
auto
En de
that
a
are same
MACs

receiveeculate
H2 both the .
> if H1
=
not been changed
has

as attecar
-

means message modified ever end


mastel
> ele message hasbe
sages Edited
using
-

modifies only which is calculated sende


MAC2ieH2
would be different
than f sent by
message
a

station digest algo


*waa
tough

Message
>
- reducethesigdroperties/
summon
*
> represent
has
-

a d
SLA-
D
Terms
(MD5
-

messagedigest
,

MD text
plain
=

No y blocks
of text
Ex car
-

2 =
each plain 1- append
I:
in
bits aged
block
og
which .. -
-
a
symmetric
-
shared e
times
=
-

repeated b/8
A string
0011010 time .
ind
=

01011010 repeated 618


ed = A string
Sp1 : check the
size of key K ~
-= Yes

key size- a
keysize (b
add
from
IHS
to
key lysigedige e
size of
the
key
theances
ke y
a
Ihashes
-

e
would be y
a
e a
iPad

Xin
t

S
M after
message
3 : append
Moriginal
message)
stepy
For hashing
op of
.

the on

: Message Digest algocalled ())


seph
use is
the result
and

·
Miea
T
K with spad to gets
XOR key
Sept
:

*
52
after
Seps
:
append H
#
to the
message digest algohashed op
stept :
apply
generate
thed
to
-
op of step6 MAC **

ie rather
H

·
a
dige

ge

&
Transformed
R
1
e
J
(messageM

digest algo
D
[

leage
digest
&

in
Triphertext
Insu
-

You might also like