Professional Documents
Culture Documents
Topic 3 Cryptography
Topic 3 Cryptography
CRYPTOGRAPHY
Outline
History
Overview of Cryptor!p"y
Hidden writing
#t!tisti$!l !tt!$)s
%!amples
'cytale
Atash
Caesar
6igen7re
History
&* 'e$"!ni$!l +r!
%!amples
German %nigma
'o(ern +r!
Computers:
%!amples+ ;ucifer. 9i<ndael. 9'A. %lGamal
product
%!ample
%er$)"o/s0s Prin$iple:
Symmetric
Asymmetric
Commercial+ pulished
2%'
G2%'
A%'
I2%A
(lowfsh
%!amples of 'ymmetric Algorithm
9CH
9CI
CA'-
'AF%9
-wofsh
5ri$ate Aey %ncryption
5ri$ate Aey %ncryption can e used+
/athematically ha$e+
Y B %0A, X1
X B 20A, Y1
Asymmetric %ncryption
L
;arge mathematical operations make it slower
than symmetric algorithms
L
>o need for out of and key distriution 0pulic
keys are pulic:1
L
'cales etter since only a single key pair needed
per indi$idual
L
Can pro$ide authentication and nonrepudiation
L
%!amples+ 9'A, %l Gamal, %CC, 2iRe&Hellman
Comple!ity Classes
Answer in polynomial space
may need e!hausti$e search
If yes, can guess and check in
polynomial time
Answer in polynomial time,
with high proaility
Answer in polynomial time
compute answer directly
P
BPP
NP
PSpace
easy
hard
Pu&li$ )ey &lueprint
re?uires
sender, recei$er
know shared
secret key
Fast encryption
5ro$ides low
security
%&
public key crypto"rap!y
Slo*er encyption
Provides !i"!er
security
Pu&li$ )ey $ryptor!p"y
%1
plaintet
messa"e# m
cip!ertet
encryption
al"orit!m
decryption
al"orit!m
Bob+s public
key
plaintet
messa"e
, -m.
B
/
,
B
/
Bob+s private
key
,
B
-
m 0 , -, -m..
B
/
B
-
Pu&li$ )ey en$ryption
!lorit"ms
%2
need A and A such that
B
B
.
.
"iven public key , # it s!ould be impossible to
compute private key ,
B
B
$e1uirements2
1
2
$SA2 $ivest# S!amir# Adelson al"orit!m
/
-
, -, -m.. 0 m
B
B
-
/
/
-
36 Hy&ri( +n$ryption
'D8
#HA29
general approaches+
AerckhoD)s 5rinciple
Cryptosystem 'trength
$ip"erte-t only
)nown pl!inte-t
$"osen pl!inte-t
$"osen $ip"erte-t
$"osen te-t
#u&stitution Cip"er
Tr!nsposition Cip"er
9 #u&stitution Cip"ers
%!ample+
meet me after the toga party
PHHW PH DIWHU WKH WRJD SDUWB
Is that secureS
followed y -,9,>,I,*,A,'
gi$en cipherte!t+
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPPESXUDBME!SX"IZ
VUEPHZHMDZSHZOWSP"PPD!SVPQUZW#MXUZUHSX
EP#EPOPDZSZUPOMBZWPUPZHMDJUD!MOHMQ
5lainte!t B mo $e fo rw ar d!
mo -G =NH
mo -G =NH
ve -G C4H
ve -G C4H
fo -G P)# etc%
fo -G P)# etc%
(* One2Time P!( .OTP*
44EE44E4
E4EEEE4E
Aey is a ne$er&repeating it
se?uence as long as plainte!t
%ncrypt y itwise Q*9 of
plainte!t and key+
cipherte!t B plainte!t key
2ecrypt y itwise Q*9 of
cipherte!t and key+
cipherte!t key B
0plainte!t key1 key B
plainte!t 0key key1 B
plainte!t
Cipher achie$es perfect secrecy if and only if
there are as many possile keys as possile plainte!ts, and
e$ery key is e?ually likely 0Claude 'hannon)s result1
4all# 2005 CPSC566 7nformation Security 8ana"ement
Ad$antages of *ne&
-ime 5ad
%asy to compute
As secure as possile
4all# 2005 CPSC566 7nformation Security 8ana"ement
9ow -ransposition Ciphers
gi$ing cipherte!t
MEM"!RH!GPR#E!EE!EO""!
&* Route $ip"er
-his is good
Cryptography works:
-his is ad