0 ratings0% found this document useful (0 votes) 25 views12 pagesCNS Unit 4
Cryptography and network security
For btech 3rd cse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
UNIT -IV
SET ES Digital Siqontees
oe me : ¥
‘+ Diget Sigeukuse
es Gs 1 AY{mmearbic . Kay cayptogeary
Rncwye Hon — prvake Fuy
Decryeticn — pustic ey
> via
Digital Fgrakne as used +3 Quuteambication 5
vay to
Noo - Sadik
YU DI AOI cook oy eee Eaoo 9
= Sen .
= A Litah Rap IB & Rennie uxd to
Vosidake the ausharnty h vagnly Qt 49-
> 0 the prypicod Gal, A Peder + Sqn & dass
4D gua dak nb dy Aegina bo eC dyagrn’!
Wey wien the Sgoabaee iy rtf tp secaticen» SET
dourssch dy Coneck Sars
ee
fra data ws indRerdentiy esate SHS cess S
cserr an Goy pve polly ,
coneantinal Babe orerang von7
daumas 4 Haraves (Pus y ceeds)
Datel Mpalet -om-one wey, o fag
dese HSNche Modes Gas A Nydaq adgortan a
i. way wneheinite one : =
» Me WANA WRK the mg, B Egnanwe Qad '
appues tre Nidttying, algoninm .
Dre CHU Chee ge rosy Ly CGR + Ofrcig
yk fy CHSC,
AUCeae |
Digital Rgoakwve _Se Sennican’
Hr \ dacypton, ~f
Os, ee aos cos
| Vag Conkiveabialy * essa, ® sie
D+ Ausrynk{cahon 1Ue sow’ com ee penn on vent cg
a sakegs 4 Hose Hut Soy Gago abn,
* We Some RGA
U- NOn- aepudiaHor : pawhed 4 ashoo, rug bed
Sb
8 po,
2 - oousn=t89}% ten Akon feng mien Ah AT TO
oeucs Boe .
B- Chaora Ma apne, Rat ¢ vabeuy AS pasc-& 5
Bonahese + So,2k chengy digbal muy vir oh
Gk Bewrtsy CO) oo
& Scumeas Of OSS"
[esa DSSoV™ -
L - chaganmah
4 8 bhndv™
gkondes
Gunve
de DS
5 ~eviekei ~
es:
a pwvak ;
i AA Urey Wy orm Fay © Yo dre ovens
pecsneeds “OMA Secu parc yy WO Ney ne door,
mY Genehalion So FS 4:
jp pendsA Chrooey. 2 PAE nodD PUY
a+ Cahkuntoke Ozer.
g- calwaks $Cn)x LPAPEHY
Ws dhooe Sa pune Gok 2 F Calalate dour wp
Mae Mook Cd =| mod Fle)
So PSALOSS , ad w& peWoke Y Cand 0 - Punic
Ace Awe gle Cea) tol
Prvatr ny
EM Ps 800) 4=400
ne PxqQ =? — Fig) ~PNCE)
@=Q00, d=240 ed =) ne an)SHAsee as ae f
go vay fd
ee
-5 Secure hash algorthen ee
> spo onpindly daainged >
> gua was revised 44 mAs >
fered version oT SHA
y, see -5ID Stucke
istTY NSAID Qa
sHA-J
—S adds 3 add
Sya-rs6, SHa->3
seiner sued
Cemporsien ob SHO Poernalts :
Suant | 584-224 [599-285 sola
[sacs [ S424 [50-250 |
ay igor a 2 ED | 1s k
Aden | niet poe
{ 28% fee
SIL eb cher
Bx [eee 3u
Wo. SPI
I 96 kM 1
Bor) ale,
Boe
ftom we Toe |... (car we)
J cane i0 Explain different Schemes of Vecoted. hay
fuactoos 2 h
® teated bash funchon :
>to ikeakd Cugptngraghic hash fuschion
shtm@, a furnctivg wth Pinel S22 ingu)
Gs Ccakd.
> ans ae wa usd a netencos'4 19+ Hruy
| > ~The Qoxed side thpuk Femchion Gy weyers
794; yeaion neko?
Se Compe arn Ue shing 1 Ceate ms:
Sbrag. : 2
whe 1 Uy Qlaky thon om
Tass]
mnaawie Damgard hash —function:
> te mane —damgasd Condbeckion Ga A “AGS
oh building. Couldior ~susisl
> the Coasbuwion Wad ated 4
cnany dgesdnord sus OD Hes SBA
pra aura ©
4 sve
Ger oth
a wed
> the ampcice Comgend aah funchen
Fs She hauk fenton, Bon Taecues
fy ah Aca ‘S13e.
@ & ceoke 09 Wyub ohox sire cs .
fae Yur"met omg
yace 1 |) Wk L” “| sug
Ger 'y
nes phe
Za) ER
wave \ wal —.
weve \ ch. Fae
®2f-u-- A fiSks
ng CU conn D
D440 hme ne da geen ne OL WO
Sarcddon as demos 6!
S she algowths Starts Uitr On dha) vale,
the inital Sabon VOD Cr}. ae w is &
Qured Value.
PL cad mY Woon. He compunsion Gackor &
Fosers He veut -
> he: ec w& Comnicied
Produces On Salen aia veauub,
ats te mag Wax oot
Seok”x meg Oe —
1 Jobeh un how ff air)
corns y Fru os ws panned
ip ro Prawe \akeqaly oh
yoaudh an alpthey galled A “cayetogcapric hedh
Anchor”
Menge pakegas by ;
> Te ack Fee Yateguahy Oh a. may @ cower
Bue Wun fre. ey pbooveghic had mio age
OMS Compose de aio dsc ragey fo Previous OL
bore ade Same yak Ss Odghoral wug »
UG, hraged
Caetons)
S Game .
UY Hfrnckony age ve ee
e MeMage Autrembcakoai
KES Corer oy O Vl > Bob. oe
The digest created 4 O cayehgiagte Fab bots
+ ta” cated (have) apniaten detector SN
hu Cady Gn dattck: GU fe modi dcahes So ra§
- WR need ug, Studbcatiaken G&S mug, Gesu?
Che -( Hac)WIDE BB ds moditi cabo AEH Code
> Mie Cn geen) Crtalt mu, & MOS aad Kad wth tH,
Praag, te MOL tr’ the Bob. Bo CO cake O Md
fon Ine 4 ok ee oo Gh by abe Suene
rn un) hes pok Shange.
Auce "1 Gb
Sayeed Chowk fs, to) \
Tal st]
thes
= ines Lt
> i eo
Serut chomnel
(pe
So waad caer OU Caoy Ot
—> eth data a orgiomal & act
=D hamye Ha HOC > MOC
> he a Hes tec Mane fa SULLA. ‘yochadie O
Stor Fey ‘Lol Alice & tb
|
Me .
Lede
oS gut
Bice wags a hah beckon to Crecte mc. for?
“4 & muy.
Mes
su SCRA Yee Garg eC) oo
wi AC
eeprfules 1X mac ong our as sy
fro SJ,qpyede bo MAC & Mus MAC OO oe doing cone
pad Hac:
a Re
> war HAC A Vogke Aer nod S09 Colidy Ody 09) wy
& kot.
pd toeme $e
Dunk Yo Mpc HAC Seunby-
Shq Ka Gep re ty GY Con takuraled Lid AQ Onn,
erate “wag digegl,
>So Ad MUp We. be Lorcalimaled Way Seay daygge” to
OAK Ae Aral, Agar.
Y
Rash
Key MaC
.
WSC? Chased Mac)
SU we be hosing hrckon Male,
~ Bree Senteday nore MM thoes Bh Wrath be wig.
> An ‘le TWBrolwe’ a padded ty hh of Ine mq.Cryptographic Hash Function Criteria:
A cryplographic hash function must satisty thee criteria
1 Presimage Resistance
2 Second Pre-image Resistance
3 Collision Resistance.
Preimage Resistance: The hash function must be a one-way function: For any given code h itis
‘computationally infeasible to find br
Tenab
Second Preimage Resistance: In this criterion, an adversary i provided withthe value of,
reper ona, sor, 700
Cryptography and Network Security B.Tech(CSE) IV Year ISem
x and is asked to compute the value of x1 # x, such that h(x) = h(x).
{ft difficult for the attacker to perform this computation we claim thatthe hash
function is second pre-image resistant.
A function without preimage resistance is usually also not second
preimage resistant: Given a message 2, calculate h := H(a1) and
then get a preimage ap from h, then we usually have a £ 22 and
H(2:) = H(22).
Collision Resistance: Collision of a hash function is the event when two values x and
xl such that x1 #x hash tothe same value, ie, h(x) = h(x!)
M: Message
Hash: Hash function
(M): DigestHMAC (iashed MAC:
HMAC algorithm stands for Hashed or Hash based Message Authentication Code
+ it uses the Hashing concept twice, so great resistant to attacker
1 HMAC consists of twin benfts of Hashing and MAC
7 The working of HMAG stars wih taking a messene
it,
M containing blocks of length b
/ Am input signature is padded tothe loft of the message and the whole is given as
input to 2 hash function which gives us a intermediate HMAC.
+ Intermediate HMAC again is appended to an output signature and the whole is applied
‘a hach function again, the result is our final HMAC of n bits
pied to
aac
By Ch Samsonu, r. 708
Cryptography and Network Security B.Tech(CSE) IV Year I Sem
EMAC (Cipher based MAC)
«+ This is similar to CBC{Cipher Block Chaining),
‘ereatos one block of MAG
+ It takes N blocks of message but
“The message is divided into N blocks of
it size. If ast block isnot m-
size,then
padded with start 1 then 0000... ke 100000.
aie teks encrypted wih key K then its outputis XOR wih the next block for
pe
‘encryption, $008, :
Taeoat block is encrypted with some adational k value fr more seutity
(CRIRC ston
Tappan oe