-2

I am writing a paper on RSA, and I am calculating some encryption running times.

I have been told that the encryption running time is $O(n^2)$ where $n$ is the modulus. I have also been told that there is a constant $C$ such that $O(Cn^2)$ where $C$ relates to the machine used.

Does anyone have any idea where to find this $C$ for a certain computer?

Mike Edward Moras
  • 18,161
  • 12
  • 87
  • 240

1 Answers1

4

You don't seem to understand what complexity means. $O(Cn^2) = O(n^2)$, so “finding $C$” is not a valid question – any positive $C$ will do.

I recommend looking up some basic complexity theory introduction. There are many introductory books on the subject which can help you understand what this means.

Mike Edward Moras
  • 18,161
  • 12
  • 87
  • 240
dionyziz
  • 585
  • 3
  • 11