Last time I informed me a little bit about the RSA cipher.
After raeding a lot of papers I really have to ask a question:
Does anybody know whats the rate of complexity/the time needed by a computer to solve a basic calculating operation to the time needed solving another basic arithmetic operation?
Just to give an example for my question:
I (let my computer) calculate
I y = a + b
II y = a * b
if I let it do n-times, while n -> endless one chain of operation will be faster than another ...
but whats the proportion of one to another ?
Would be nice of anybody who knows this to post a little collocation of the most common basic calculatin operations.
Thank You
Prime Factorisation
Perhaps http://en.wikipedia.org/wiki/Computatio ... operations would answer your questions.