I am having a struggle calculating (ii) and (iii), Can anybody help me with the calculation? RSA blind signature algorithm: Given two prime numbers: $p=11$ and $q=3$ The message to be signed is: $M=6$ The public key is: $e=7$ (i) List all the possible candidates of the blinding factor $R$. $n=33$ $phi(33)=20$ ${1,2,4,5,7,8,10,13,14,16,17,19,20,23,25,26,28,29,31,32}$ (ii) If the chosen $R$ is $2$, find out $R^{−1}$(inverse). (iii) Calculate the signature with blinding factor $S’$.

How does RSA blind signature calculation works?

Cryptography Asked by Navid Niknezhad on November 18, 2020

I am having a struggle calculating (ii) and (iii), Can anybody help me with the calculation?

RSA blind signature algorithm:
Given two prime numbers: $p=11$ and $q=3$
The message to be signed is: $M=6$
The public key is: $e=7$

(i) List all the possible candidates of the blinding factor $R$.
$n=33$
$phi(33)=20$
${1,2,4,5,7,8,10,13,14,16,17,19,20,23,25,26,28,29,31,32}$
(ii) If the chosen $R$ is $2$, find out $R^{−1}$(inverse).
(iii) Calculate the signature with blinding factor $S’$.

Get help from others!