(a)
s = m
d
mod n
(b)
m' = s
e
mod n
Example 1: (a) The RSA signature primitive computes the equation; (b) recovering the message representative m'.
Back to Article