Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

I have blinded $m = 16$ with $r= 13$, $e = 7$ and $n = 209$. This resulted in $m' = 464$, which led to a $s' = 8$.

Now, I want to unblind this $s'$ by using $s = s' \times r^{-1}$ but im stuck at filling in the $r^{-1}$?

share|improve this question
What's your value for $d$ and how have you computed it? You need to find $x$ such that $x \cdot 13\equiv 1 \pmod{209}$. This $x$ is the value $r^{-1}$ you are seeking. Hint: extended euclid –  DrLecter Nov 25 '13 at 20:43
@DrLecter If i calculate it via the extended euclid r$^{-1}$ = 16, is that correct? –  ziggy34 Nov 25 '13 at 23:59
Nope. You just have to check if $13\cdot 16 =1 \mod p$, which is not the case (it's $-1$ or equivalently $208$). –  DrLecter Nov 26 '13 at 7:51
Just a side question: in practice, would it be safe to let $r$ be a 10-digit prime relative to $n$? –  Kate Dec 12 '14 at 20:27

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.