**Setup**

Let:

m - Message

i - Identity

n - Composite of two large primes

f - One way function

*g*

^{e}= i (mod n)Note: Think of this as RSA decryption of an encryption of

*i*which is

*g*.

Where e is a large prime that is relatively prime to Φ(n)

g - private

e - public

**Signature**

*t = r*,

^{e}(mod n)*r*- random

*s = g∙r*

^{f(t,m)}(mod n)*<s,t>*is the signature value sent to the receiver of message

*m*.

**Verification**

Test:

*s*

^{e}== i∙t^{f(t,m)}(mod n)**This works because**

*s*

^{e}== g^{e}∙r^{e∙f(t,m)}(mod n)Since

*t = r*and

^{e}*g*:

^{e}= i=>

*s*

^{e}== i∙t^{f(t,m)}(mod n)
## No comments:

Post a Comment