The IEEE 802.11x networks use radio signals to move packets. Both 802.11b and 802.11g use the 2.4 Megahertz frequency, also used by wireless phones and other appliances. The main difference between the two is the data rate: 11 Megabits per second for 802.11b and 54 Megabits per second for 802.11g. Real world throughput is about half the data rate.
I can see the leftovers after the Google Desktop scan in internet history now...
Ads by Gooooooooogle
Our prices on bombs are rock bottom!! Shop Bombwharehouse.com Alqueda training videos, only $19.95 + sh/h
Interested in becoming a pilot? We teach! Fly for Jihad Airlines.
Ads by Gooooooooogle
To put this in perspective, it would require about 1.4 billion 500 MHz machines, each with about 170 Gbytes of memory to do the sieving for a 1024-bit number in the same time as RSA-512. While a hacker might try to steal cycles on the Internet by creating a ?Number Field Sieve Worm? it is hard to see how such an attack could find enough machines with enough memory to make such an attack feasible. Further, such an attack would be detected and shut down rather quickly as with the Robert Morris worm. Of course increasing speed will reduce the required number accordingly. It would take a single Cray with 6 Terabytes of memory approximately 70 million days (192,000 years) to solve the matrix. One could reduce this to a mere 19 years with 10000 Crays each with only 600 Mbytes of memory running perfectly in parallel. It is likely that within 10 years common desktop machines will be as fast or faster than a Cray C90 is now. However, it is unlikely in the extreme that 10000 machines running in parallel will be anywhere close to 10000 times as fast as one machine. It would require 10 million such machines running perfectly in parallel to solve the matrix in about the same time as that for RSA-512.
So basically, according to the article from RSA it's not feasable... but still an interesting IDEA. Maybe a worm that installs something like folding@home that would have immediate benefits.;)
Hoped and prayed that something like this would come along eventually. Thanks for posting a good story!
I don't know anything about QEMU, does this have socket support? Is it treated as a virtual machine or are the programs executed in knoppix each a seperate process?
The real question is, can it detect BODIES? DEAD BODIES???
**insert evil laugh here***
I stopped reading there.
Right click on the blacked out text starting on page 18 in the document the article links to here.
A popup menu appears with the phrase "Lookup XXXXX" where XXXXX is the word that is blacked out. Cool, eh? =)
Brian Bouchard has already got this problem all figured out you morons. And the answer is wood. Brilliant!
NASA has announced the development and deployment of giant cans of 'Space RAID'.
JAXA engineer Nobuyuki Kaya responded to news of the development with the remark, "RAID???!", just before his head exploded in a puff of smoke.
Wow, Europe sure had alot more people in 1984!
Redeem them for valuable prizes.
"It's not TCO (total cost of ownership), or security, or lack of license fees," Dave Rosenberg said. "It's about the lack of a talking paper clip."
Great. Now all the terrorists will be wearing sunglasses. 8-)
from http://www.rsasecurity.com/rsalabs/node.asp?id=208 8
;)
To put this in perspective, it would require about 1.4 billion 500 MHz machines, each with about 170 Gbytes of memory to do the sieving for a 1024-bit number in the same time as RSA-512. While a hacker might try to steal cycles on the Internet by creating a ?Number Field Sieve Worm? it is hard to see how such an attack could find enough machines with enough memory to make such an attack feasible. Further, such an attack would be detected and shut down rather quickly as with the Robert Morris worm. Of course increasing speed will reduce the required number accordingly. It would take a single Cray with 6 Terabytes of memory approximately 70 million days (192,000 years) to solve the matrix. One could reduce this to a mere 19 years with 10000 Crays each with only 600 Mbytes of memory running perfectly in parallel. It is likely that within 10 years common desktop machines will be as fast or faster than a Cray C90 is now. However, it is unlikely in the extreme that 10000 machines running in parallel will be anywhere close to 10000 times as fast as one machine. It would require 10 million such machines running perfectly in parallel to solve the matrix in about the same time as that for RSA-512.
So basically, according to the article from RSA it's not feasable... but still an interesting IDEA. Maybe a worm that installs something like folding@home that would have immediate benefits.
Since when is an 80mb download size mamoth? Unless that's a typo that's supposed to read '800'.
Thats the only real reason that they want teh intarweb in 3rd world countries.... THEY WANT OUR PR0N!!!!
and even I find these editings by Zonk pathetic. Maybe his name is zonk because he's alseep at the keyboard. Seriously, WTF?
They want their 50,000 for unlicensed distribution. They just signed Saturn.
"Hey Bob, I've got an idea. We'll repost stories just to tick off our readers and never verify links."
BRILLIANT! BRILLIANT!!!
the goat man was created c. 1998, thanks to a top secret project just like this that went ary!
stop!!
That's what the power grid is for (and its inherent beauty).
Moving energy from one place to another.
Once it's on the grid, it can be used almost anywhere.
I have a karma of zero =( should have read the article. I hate my life (*blows brains out*)
spelled peace wrong. that's that piece is like 'piece of doodie'. Just goes to show the quality eds we have here at /. WTF@
Can go faster than your data!
of a Reeeally bad movie.
I find it to be very slow. Also, can't touch the local volumes and no network support. Very cool concept, but still a long way to go.
Hoped and prayed that something like this would come along eventually. Thanks for posting a good story! I don't know anything about QEMU, does this have socket support? Is it treated as a virtual machine or are the programs executed in knoppix each a seperate process?