• how $C =M^e \bmod N$ can be written as $C = M \cdot k \bmod N$ in RSA algorithm?

  • how $M =c^d \bmod N$ can be written as $M = c.k^{-1} \bmod N$ in RSA algorithm?

  • 2
    $\begingroup$ Welcome to Cryptography. Is this homework? $\endgroup$ – kelalaka Jan 22 at 9:16
  • $\begingroup$ I fail to see the use of the questions. For the first one, is there anything wrong with the obvious: $k=M^{(e-1)}$, or the usually smaller $k=M^{(e-1)}\bmod N$ ? They both yields a $k$ with $M^e \bmod N\ =\ C\ =\ M\cdot k\bmod N$. $\endgroup$ – fgrieu Jan 23 at 14:03

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.