Professional Documents
Culture Documents
, University of Windsor
Cryptanalyst
Oct. 7, 2003
^X
1
Source A
Message Source
Destination B
Encryption
Algorithm
Destination
Decryption^KRb X
Algorithm
KRb
KUb
eKUb (X)
The intended receiver, i.e., Bob, in procession of the matching private key,
is able to invert the transformation:
X = dKRb ( Y )
An opponent, Oscar, observing Y and having access to KUb but not
having access to KRb or X, tries to recover X and/or KRb. It is also
assumed that Oscar does have knowledge of the encryption and
decryption algorithms. Thus, Oscar attempts to recover X and KRb by
generating estimates X and KRb.
5.2
We mentioned earlier that either of the two related keys can be used for
encryption, with the other being used for decryption. This enables an
Oct. 7, 2003
eKRa (X)
Cryptanalyst
^KRa
Source A
Message Source
Destination B
Encryption
Algorithm
Decryption
Algorithm
Destination
KUa
KRa
Key Pair Source
Bob can decrypt the message using Alices public key. Because the
message was encrypted using Alices private key, only Alice could have
prepared the message. Therefore, the entire encrypted message serves
as a digital signature. In addition, it is impossible to alter the message
without access to Alices private key, so the message is authenticated
both in terms of source and in terms of data integrity.
Oct. 7, 2003
X
Message
source
Destination B
Y
Encryption
Algorithm
Z
Encryption
Algorithm
Decryption
Algorithm
X
Decryption
Algorithm
Message
Destination
KRb
KUb
KRa
Key Pair
Source
Key Pair
Source
KUa
Y=
eKRa (X)
This provides the digital signature. Next, we encrypt again, using the
receivers public key, KUb:
Z = eKUb (Y) = eKUb (eKRa (X))
The final ciphertext, Z, can be decrypted only by the intended receiver,
who has alone the matching private key KRb and public key of the
receiver, KUa:
X = dKUa (Y) = dKUa (dKRb (Z))
Thus, confidentiality is provided. The disadvantage of this approach is that
the public-key algorithm, which is complex, must be exercised four times
than two in each communication.
5.4
KUb (M)
(3) It is computationally easy for the receiver Bob to decrypt the resulting
ciphertext using the private key to recover the original message:
M=
Oct. 7, 2003
eKUb(dKRb (M))
Note 1: The requirements boils down to the need for a trap-door one-way
function. A one-way function (not to be confused with one-way hash
function!) is one that maps a domain into a range such that every function
value has a unique inverse, such that the calculation of the function is
infeasible:
Y = f (x)
easy
X = f-1(Y)
infeasible
X = fk-1(X)
X = fk-1(X)
Oct. 7, 2003