D-Link DFL-2500 User Guide - Page 216

Asymmetric Encryption, Hybrid Encryption

Page 216 highlights

20.2. Introduction to Cryptography 197 Asymmetric Encryption A pair of keys is used in asymmetric encryption, one called a public key, which can be available to anyone who wants to use encryption, and the other, called a private key, that must be kept confidentially and is known only by the owner. The two keys are very large prime numbers and mathematically related, but one can not be used for resolving the other. Anyone can send private information to a recipient, say A, by encrypting the information using A s public key. But only A will be able to recover the information by decrypting the ciphertext using the related private key. Moreover, if some known information can be correctly recovered by decrypting with A s public key, it must have been encrypted with A s private key, and therefore by A. This means that asymmetric algorithms provide proof of origin. RSA and DSA are the most well-known and most commonly-used asymmetric algorithms. Compared to symmetric encryption, the much longer keys cause slower speed and intensive resource use to asymmetric encryption, and hence unsuitable for encrypting large quantity of data. It is generally used for aiding the symmetric key distribution and authentication tasks. The combination of symmetric and asymmetric algorithms is called Hybrid Encryption. Hybrid Encryption The hybrid encryption combines the best of the two worlds: symmetric and asymmetric algorithms. The symmetric key provides the fastest encryption and decryption, and the asymmetric scheme provides a convenient way to share the secret key. Diffie-Hellman key exchange protocol: The Diffie-Hellman protocol allows users to exchange a secret key over an insecure medium without any prior secrets, which is one of the most widely used key exchange methods supporting various secure Internet protocols, e.g. SSL, SSH, and IPsec. In the protocol, each side of the connection generates a related private-public key pair, and publishes the public part. After the public key exchange, one is able to compute a new secret key using one's private key and the other's public key. The resulting key is common to both sides, and can be used as a shared secret key for symmetric encryption. In such a way, D-Link Firewalls User's Guide

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
  • 51
  • 52
  • 53
  • 54
  • 55
  • 56
  • 57
  • 58
  • 59
  • 60
  • 61
  • 62
  • 63
  • 64
  • 65
  • 66
  • 67
  • 68
  • 69
  • 70
  • 71
  • 72
  • 73
  • 74
  • 75
  • 76
  • 77
  • 78
  • 79
  • 80
  • 81
  • 82
  • 83
  • 84
  • 85
  • 86
  • 87
  • 88
  • 89
  • 90
  • 91
  • 92
  • 93
  • 94
  • 95
  • 96
  • 97
  • 98
  • 99
  • 100
  • 101
  • 102
  • 103
  • 104
  • 105
  • 106
  • 107
  • 108
  • 109
  • 110
  • 111
  • 112
  • 113
  • 114
  • 115
  • 116
  • 117
  • 118
  • 119
  • 120
  • 121
  • 122
  • 123
  • 124
  • 125
  • 126
  • 127
  • 128
  • 129
  • 130
  • 131
  • 132
  • 133
  • 134
  • 135
  • 136
  • 137
  • 138
  • 139
  • 140
  • 141
  • 142
  • 143
  • 144
  • 145
  • 146
  • 147
  • 148
  • 149
  • 150
  • 151
  • 152
  • 153
  • 154
  • 155
  • 156
  • 157
  • 158
  • 159
  • 160
  • 161
  • 162
  • 163
  • 164
  • 165
  • 166
  • 167
  • 168
  • 169
  • 170
  • 171
  • 172
  • 173
  • 174
  • 175
  • 176
  • 177
  • 178
  • 179
  • 180
  • 181
  • 182
  • 183
  • 184
  • 185
  • 186
  • 187
  • 188
  • 189
  • 190
  • 191
  • 192
  • 193
  • 194
  • 195
  • 196
  • 197
  • 198
  • 199
  • 200
  • 201
  • 202
  • 203
  • 204
  • 205
  • 206
  • 207
  • 208
  • 209
  • 210
  • 211
  • 212
  • 213
  • 214
  • 215
  • 216
  • 217
  • 218
  • 219
  • 220
  • 221
  • 222
  • 223
  • 224
  • 225
  • 226
  • 227
  • 228
  • 229
  • 230
  • 231
  • 232
  • 233
  • 234
  • 235
  • 236
  • 237
  • 238
  • 239
  • 240
  • 241
  • 242
  • 243
  • 244
  • 245
  • 246
  • 247
  • 248
  • 249
  • 250
  • 251
  • 252
  • 253
  • 254
  • 255
  • 256
  • 257
  • 258
  • 259
  • 260
  • 261
  • 262
  • 263
  • 264
  • 265
  • 266
  • 267
  • 268
  • 269
  • 270
  • 271
  • 272
  • 273
  • 274
  • 275
  • 276
  • 277
  • 278
  • 279
  • 280
  • 281
  • 282
  • 283
  • 284
  • 285
  • 286
  • 287
  • 288
  • 289
  • 290
  • 291
  • 292
  • 293
  • 294
  • 295
  • 296
  • 297
  • 298
  • 299
  • 300
  • 301
  • 302
  • 303
  • 304
  • 305
  • 306
  • 307
  • 308
  • 309
  • 310
  • 311
  • 312
  • 313
  • 314
  • 315
  • 316
  • 317
  • 318
  • 319
  • 320
  • 321
  • 322
  • 323
  • 324
  • 325
  • 326
  • 327
  • 328
  • 329
  • 330
  • 331
  • 332
  • 333
  • 334
  • 335
  • 336
  • 337
  • 338
  • 339
  • 340
  • 341
  • 342
  • 343
  • 344
  • 345
  • 346
  • 347
  • 348
  • 349
  • 350
  • 351
  • 352
  • 353
  • 354
  • 355
  • 356
  • 357
  • 358
  • 359
  • 360
  • 361
  • 362
  • 363
  • 364
  • 365

20.2. Introduction to Cryptography
197
Asymmetric Encryption
A pair of keys is used in asymmetric encryption, one called a
public key
,
which can be available to anyone who wants to use encryption, and the
other, called a
private key
, that must be kept confidentially and is known
only by the owner.
The two keys are very large prime numbers and mathematically related,
but one can not be used for resolving the other. Anyone can send private
information to a recipient, say
A
, by encrypting the information using A
±
s
public key
. But only A will be able to recover the information by decrypting
the ciphertext using the related
private key
. Moreover, if some known
information can be correctly recovered by decrypting with A
±
s public key, it
must have been encrypted with A
±
s private key, and therefore by A. This
means that asymmetric algorithms provide proof of origin.
RSA
and
DSA
are the most well-known and most commonly-used asymmetric algorithms.
Compared to symmetric encryption, the much longer keys cause slower
speed and intensive resource use to asymmetric encryption, and hence
unsuitable for encrypting large quantity of data. It is generally used for
aiding the symmetric key distribution and authentication tasks. The
combination of symmetric and asymmetric algorithms is called Hybrid
Encryption.
Hybrid Encryption
The hybrid encryption combines the best of the two worlds: symmetric and
asymmetric algorithms. The symmetric key provides the fastest encryption
and decryption, and the asymmetric scheme provides a convenient way to
share the secret key.
Diffie-Hellman key exchange protocol:
The Diffie-Hellman protocol allows users to exchange a secret key over an
insecure medium without any prior secrets, which is one of the most widely
used key exchange methods supporting various secure Internet protocols,
e.g. SSL, SSH, and IPsec.
In the protocol, each side of the connection generates a related
private-public key pair, and publishes the public part. After the public key
exchange, one is able to compute a new secret key using one’s private key
and the other’s public key. The resulting key is common to both sides, and
can be used as a shared secret key for symmetric encryption. In such a way,
D-Link Firewalls User’s Guide