Presented By: B.Bhagyalakshmi Adam'S Engineering College.:, Iv/Iv-Cse
Presented By: B.Bhagyalakshmi Adam'S Engineering College.:, Iv/Iv-Cse
Presented By: B.Bhagyalakshmi Adam'S Engineering College.:, Iv/Iv-Cse
B.BHAGYALAKSHMI,
IV/IV-CSE,
3. She then splits this 128-bit value K into two 64-bit halves.
We can name them as k1 and k2 and refer to them as the key
pair.
7. Alice now has three different values, c, r and s. She then has to get
these three values to Bob in order to complete the transaction. She
can do this in a couple of ways. She can send them all at one time .
Steps involved in Unsigncrypting
a message.
1. Bob receives the 3 values that Alice has sent him, c, r and
s. He uses the values of r and s, his private key xb, Alice’s
public key ya and p and g to compute a hash which would
give him 128-bit result. K = hash ((ya * gr)s X xb mod p)
2. Bob then uses the key, k1, to decrypt the cipher text c, which
will give him the message m. m = Dk1(c)
3. Now Bob does a one-way keyed hash function on m using
the key k2 and compares the result with the value r he received
from Alice. If they match, it means that the message m was
indeed signed and sent by Alice, if not Bob will know that the
message was either not signed by Alice or was intercepted and
modified by an intruder. Thus Bob accepts the message only if
KHk2(m) = r.
Features
Unique unsigncryptability: The unsigncryption is
unique to the message m and the sender.