Author 
Message 
Andr3w
Joined: 04 Nov 2008 Posts: 40 Location: Germany 

Prime Factorisation 

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 ntimes, 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


Fri Feb 27, 2009 3:50 pm 


MerickOWA
Joined: 07 Apr 2008 Posts: 182 Location: HkRkoz al KuwaiT 2019 HaCkEr 101 


Fri Feb 27, 2009 9:10 pm 


Andr3w
Joined: 04 Nov 2008 Posts: 40 Location: Germany 



You're great, thank you!
In the german wiki the table is missing ...


Sat Feb 28, 2009 11:53 am 


