![]() |
|
|
#12 | |
|
Aug 2002
26×5 Posts |
Quote:
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. |
|
|
|
|
|
|
#13 | |
|
Jan 2003
North Carolina
2·3·41 Posts |
Quote:
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 |
|
|
|
|
|
|
#14 |
|
Sep 2002
26210 Posts |
woohoo john,
I want some of that stuff you`re taking man. joss |
|
|
|
|
|
#15 | |||
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22·3·641 Posts |
Quote:
Each doubling increases your lifeTFtime by another bit! Quote:
Quote:
|
|||
|
|
|
|
|
#16 | |
|
Jan 2003
North Carolina
2·3·41 Posts |
Quote:
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 |
|
|
|
|
|
|
#17 |
|
"Sander"
Oct 2002
52.345322,5.52471
118910 Posts |
Don't forget that we'll be testing much larger numbers by that time.
This will give you a couple of extra bits |
|
|
|
|
|
#18 | ||
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
Quote:
Quote:
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. |
||
|
|
|
|
|
#19 |
|
May 2003
25×3 Posts |
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. |
|
|
|
|
|
#20 | |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
Quote:
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. |
|
|
|
|
|
|
#21 |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
170148 Posts |
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).
|
|
|
|
|
|
#22 |
|
May 2003
25·3 Posts |
Thx for the link to the article, Cheesehead. I found it very interesting and had not read it.
|
|
|
|
![]() |
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 |