mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2003-07-28, 07:41   #12
ColdFury
 
ColdFury's Avatar
 
Aug 2002

26×5 Posts
Default

Quote:
For example, I use a 2048-bit key for my sshd session... If I'm thinking about this right that key should be impossible to crack, right?

I mean, RC5 took forever to crack 64 bits, right?
RC5 is a symmetric algorithm, there's no known faster way than to try a brute force.

RSA isn't a symmetric algorithm. To "break" the key, you just need to factor the 2048 bit number. There are a variety of ways to do this, trial factoring being the slowest.

You could say the "value of a bit" is smaller in RSA than in symmetric algorithms.
ColdFury is offline   Reply With Quote
Old 2003-07-28, 22:31   #13
nomadicus
 
nomadicus's Avatar
 
Jan 2003
North Carolina

2·3·41 Posts
Default

Quote:
Originally Posted by cheesehead
The entire universe could TF a number no larger than 2^2800. (Using our current trial-factoring methods and optimizations, that is.)
I actually understand this!

Thanks cheesehead, that kind of puts things in perspective.

So when I TF M19435217 to 67 bits (let's say that takes prime95 24 hours), I might have found a factor at 68 to 70 bits by waiting 2 to 8 extra days but the odds are against it.

To TF to 80 bits increases my odds of finding a factor but only if I were really, really patient -- as in wait a couple of decades.
Even then the payoff would most likely be "no factor found." (80 < sqrt(19435217)).

So a TF to 83 bits would not happen in my lifetime.

So let's see if I have things in perspective. My lifetime expectancy can be measured in TF bits which is something less then 83 bits. And the odds are that my TF lifetime accomplishment will be "no factor found."

More to the point, since I am 45, I might live another 81 bits and my epitaph should say "no factor found."

Where else, except for GIMPS, can I find such great information about myself???

-=- john
nomadicus is offline   Reply With Quote
Old 2003-07-29, 00:04   #14
jocelynl
 
Sep 2002

26210 Posts
Default

woohoo john,

I want some of that stuff you`re taking man.

joss
jocelynl is offline   Reply With Quote
Old 2003-07-29, 00:48   #15
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22·3·641 Posts
Default

Quote:
Originally Posted by nomadicus
So a TF to 83 bits would not happen in my lifetime.
But remember Moore's Law: The speed of CPUs doubles every 18 months. Also, recently Mr. Moore said it's now more like 14 months between doublings.

Each doubling increases your lifeTFtime by another bit!

Quote:
since I am 45,
If you live another 35 years = 420 months, and CPU speeds double every 14 months, then you'd see your lifeTFtime increase from 83 to 113 bits!!

Quote:
my epitaph should say "no factor found."
That's deep ... really deep.
cheesehead is offline   Reply With Quote
Old 2003-07-29, 13:40   #16
nomadicus
 
nomadicus's Avatar
 
Jan 2003
North Carolina

2·3·41 Posts
Default

Quote:
Originally Posted by cheesehead
But remember Moore's Law:
Moore's Law is not about doubling speed, rather the doubling of transistors on an integrated circuit.
Regardless, I really like the idea that I should make it past 100 bits old. Who knows what technology holds in the future? 113 bits (plus or minus) gives me something to look forward to. :D
nomadicus is offline   Reply With Quote
Old 2003-07-29, 15:48   #17
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

118910 Posts
Default

Don't forget that we'll be testing much larger numbers by that time.

This will give you a couple of extra bits
smh is offline   Reply With Quote
Old 2003-07-30, 01:23   #18
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

Quote:
Originally Posted by nomadicus
Moore's Law is not about doubling speed, rather the doubling of transistors on an integrated circuit.
Oh, that's right. Moore's Law is not even a quote of Gordon Moore -- it was originally stated by someone who read Moore's 1965 paper, where what Moore actually wrote was:
Quote:
Originally Posted by Gordon Moore
The complexity [of integrated circuits] for minimum component costs has increased at a rate of roughly a factor of two per year
In 1975 Mr. Moore revised this from doubling every year to doubling every two years. "David House, an Intel executive at the time, noted that the changes would cause computer performance to double every 18 months." ("Moore's Law to roll on for another decade" - CNET News February 10, 2003)

So it's really "House's Law" that many (including me) often quote as Moore's Law.

By the way, "Forget Moore's Law", an essay by Michael S. Malone at Red Herring has an interesting take. If he's right, we might not see that 113-bit TF anyway because Intel et al. will stop turning out faster-and-faster CPUs before then.
cheesehead is offline   Reply With Quote
Old 2003-07-30, 01:58   #19
Axel Fox
 
Axel Fox's Avatar
 
May 2003

25×3 Posts
Default

You're quite right, Cheesehead.

I don't know the exact boundary, but both Intel and AMD are closing to the absolute limit of modern CPUs because of the limits of the structure and architecture modern computers are based on. Intel and AMD engineers are already working on a completely new way to make CPUs and new architectures.

The only problem is making this new "CPU system" (preferrably even backward) compatible with the current CPUs.

The same thing is also happening with HDDs, it's almost impossible to make the magnetic surfaces even smaller without drastically increasing the risk of losing magnetisation. For this there are however already prototypes being tested. Don't know exactly how it worked anymore, but I read it in an article of a local Scientific Magazine (something like Scientific American, but in Dutch).

Axel Fox.
Axel Fox is offline   Reply With Quote
Old 2003-07-31, 01:47   #20
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

Quote:
Originally Posted by Axel Fox
You're quite right, Cheesehead.

I don't know the exact boundary, but both Intel and AMD are closing to the absolute limit of modern CPUs because of the limits of the structure and architecture modern computers are based on. Intel and AMD engineers are already working on a completely new way to make CPUs and new architectures.
But did you read Michael S. Malone's article? It's at http://www.redherring.com/insider/2003/02/moore021003.html

If Malone is right, Intel/AMD won't get near that limit you mention, or at least their progress will greatly slow long before that limit, regardless of new architecture or way to make CPUs, for non-engineering reasons.
cheesehead is offline   Reply With Quote
Old 2003-08-01, 06:31   #21
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

170148 Posts
Default

OTOH, once nanotechnology gets going, one of the obvious early applications would be to have nanobots make the circuits. With precision placement of individual atoms, bypassing shadow mask limitations, it might be feasible to rapidly skip several orders of magnitude in (performance per cost).
cheesehead is offline   Reply With Quote
Old 2003-08-02, 13:18   #22
Axel Fox
 
Axel Fox's Avatar
 
May 2003

25·3 Posts
Default

Thx for the link to the article, Cheesehead. I found it very interesting and had not read it.
Axel Fox is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Modifying the Lucas Lehmer Primality Test into a fast test of nothing Trilo Miscellaneous Math 25 2018-03-11 23:20
Lucas-Lehmer test Mathsgirl Information & Answers 23 2014-12-10 16:25
Question on Lucas Lehmer variant (probably a faster prime test) MrRepunit Math 9 2012-05-10 03:50
Lucas-Lehmer test proof etc. science_man_88 Miscellaneous Math 48 2010-07-14 23:33
Lucas-Lehmer Test storm5510 Math 22 2009-09-24 22:32

All times are UTC. The time now is 17:46.


Fri Jul 16 17:46:58 UTC 2021 up 49 days, 15:34, 1 user, load averages: 2.19, 1.61, 1.53

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.