hacker.org Forum Index
RegisterSearchFAQMemberlistUsergroupsLog in
Prime Factorisation

 
Reply to topic    hacker.org Forum Index » Challenges View previous topic
View next topic
Prime Factorisation
Author Message
Andr3w



Joined: 04 Nov 2008
Posts: 40
Location: Germany

Post Prime Factorisation Reply with quote
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
Fri Feb 27, 2009 3:50 pm View user's profile Send private message
MerickOWA



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

Post Reply with quote
Perhaps http://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations would answer your questions.
Fri Feb 27, 2009 9:10 pm View user's profile Send private message
Andr3w



Joined: 04 Nov 2008
Posts: 40
Location: Germany

Post Reply with quote
You're great, thank you!

In the german wiki the table is missing ...
Sat Feb 28, 2009 11:53 am View user's profile Send private message
Display posts from previous:    
Reply to topic    hacker.org Forum Index » Challenges All times are GMT
Page 1 of 1

 
Jump to: 
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum


Powered by phpBB © 2001, 2005 phpBB Group
Design by Freestyle XL / Flowers Online.