Download presentation
Presentation is loading. Please wait.
1
p1. Public-Key Cryptography and RSA 5351: Introduction to Cryptography Spring 2013
2
p2. Public-Key Cryptography Also known as asymmetric-key cryptography. Each user has a pair of keys: a public key and a private key. The public key is used for encryption. –The key is known to the public. The private key is used for decryption. –The key is only known to the owner.
3
p3. Why Public-Key Cryptography? Developed to address two main issues: –key distribution –digital signatures Invented by Diffie & Hellman in 1976.
4
p4.
5
p5.
6
p6.
7
p7.
8
p8.
9
p9. Modular Arithmetic
10
p10.
11
p11.
12
p12.
13
p13.
14
p14.
15
p15.
16
p16.
17
p17.
18
p18.
19
p19.
20
p20. The Chinese Remainder Problem A problem described in an ancient Chinese arithmetic book, Sun Tze Suan Ching, by Sun Tze (around 300AD, author of The Art of War). Problem: We have a number of objects, but we do not know exactly how many. If we count them by threes we have two left over. If we count them by fives we have three left over. If we count them by sevens we have two left over. How many objects are there?
21
p21.
22
p22. Example: Chinese remainder theorem
23
p23.
24
p24.
25
p25.
26
p26.
27
p27. Algorithms
28
p28.
29
p29.
30
p30.
31
p31.
32
p32.
33
p33.
34
p34. The RSA Cryptosystem RSA Encryption RSA Digital Signature
35
p35.
36
p36.
37
p37.
38
p38.
39
p39.
40
p40.
41
p41.
42
p42.
43
p43.
44
p44.
45
p45. Attacks on RSA
46
p46.
47
p47.
48
p48.
49
p49.
50
p50.
51
p51. RSA-200 = 27,997,833,911,221,327,870,829,467,638, 722,601,621,070,446,786,955,428,537,560, 009,929,326,128,400,107,609,345,671,052, 955,360,856,061,822,351,910,951,365,788, 637,105,954,482,006,576,775,098,580,557, 613,579,098,734,950,144,178,863,178,946, 295,187,237,869,221,823,983.
52
p52.
53
p53.
54
p54.
55
p55.
56
p56.
57
p57.
58
p58.
59
p59.
60
p60.
61
p61.
62
p62.
63
p63.
64
p64.
65
p65.
66
p66. Padded RSA
67
p67.
68
p68.
69
p69.
70
p70.
71
p71.
72
p72.
73
p73. 0 n 2n 3n 4n ns 2B 3B
74
p74. 2B 3B
75
p75.
76
p76. CCA-Secure RSA in the Random Oracle Model
77
p77.
78
p78.
79
p79.
80
p80.
81
p81.
82
p82.
83
p83.
84
p84. Digital Signatures
85
p85. Message m MAC k (m) Message m Sig sk (m)
86
p86.
87
p87. MCED PK Bob SK Bob Alice Bob M M SED PK Bob SK Bob Alice Bob Verify the signature Sign Encryption (using RSA): Signing (using RSA -1 ): E(S) =M?
88
p88.
89
p89.
90
p90.
91
p91.
92
p92.
93
p93.
94
p94.
95
p95.
96
p96.
97
p97.
98
p98.
99
p99.
100
p100.
101
p101.
102
p102.
103
p103.
104
p104. Generating large primes To set up an RSA cryptosystem, we need two large primes p and q.
105
p105.
106
p106.
107
p107.
108
p108.
109
p109.
110
p110.
111
p111.
112
p112.
113
p113.
114
p114.
115
p115.
116
p116.
117
p117.
118
p118.
119
p119.
120
p120.
121
p121.
122
p122.
Similar presentations
