A major breakthrough in understanding the power of quantum computers came in 1994, when Shor showed how, with a quantum computer, one can factor large numbers using a number of computational steps comparable to the number of steps needed to multiply two numbers. In other words, if we allow quantum computational steps, we can factor efficiently. Many public-key encryption systems in use today require that factoring large numbers is exponentially harder than multiplying. That is, we need that encoding the information is roughly as easy as multiplying, but cracking the code is exponentially harder and thus infeasible. Another widely used class of public-key encryption systems assumes that finding discrete logarithms in various mathematical groups is hard, but Shor also came up with an efficient algorithm for finding discrete logarithms. This algorithm can easily be generalized in order to crack any of the discrete logarithm based cryptographic systems. Shor won the 1999 Godel prize for this work. His factoring algorithm was the topic of his first distinguished lecture.
People here seem to think that this breakthrough is limited to factoring, when it's apparent that it's equally applicable to all one-way functions. All that's needed is to construct the appropriate algorithm, and have a quantum computer to run it on.
Here's an interesting snippet I found while perusing the PDF...thought I'd share.
On the other hand, this paper does not validate our goal of increased dependence. Measuring that aspect of a system is significantly more challenging than performance. We do not yet have results for Singularity.
Interesting...Singularity is ostensibly supposed to be about stability, but the 44-page paper has no data on this. Kinda like saying, "Our new bulletproof vest is 40% lighter than our leading competitors, and twice as flexible. How well does it stop bullets, you ask? Sorry...we do not yet have results for that benchmark.".
Wake me when a paper comes out about Microsoft's new stability-oriented OS that actually addresses that particular aspect of the product.
A major breakthrough in understanding the power of quantum computers came in 1994, when Shor showed how, with a quantum computer, one can factor large numbers using a number of computational steps comparable to the number of steps needed to multiply two numbers. In other words, if we allow quantum computational steps, we can factor efficiently. Many public-key encryption systems in use today require that factoring large numbers is exponentially harder than multiplying. That is, we need that encoding the information is roughly as easy as multiplying, but cracking the code is exponentially harder and thus infeasible. Another widely used class of public-key encryption systems assumes that finding discrete logarithms in various mathematical groups is hard, but Shor also came up with an efficient algorithm for finding discrete logarithms. This algorithm can easily be generalized in order to crack any of the discrete logarithm based cryptographic systems. Shor won the 1999 Godel prize for this work. His factoring algorithm was the topic of his first distinguished lecture.
Looks like the algorithm has already been found...just waiting for the hardware to run it on at this time.
Actually, no. The breakthrough here isn't just a much faster computer...if that was the cse, you'd be right...just increase the length of your encryption key to compensate. The breakthrough here is a computer capable of solving formerly exponentially-difficult functions in polynomial time, rather than exponential time. It completely rewrites the rules.
The summary is a bit fuzy on the details, but here's a telling excerpt from the IBM research article on their quantum computer (link here):
A quantum computer gets its power by taking advantage of certain quantum properties of atoms or nuclei that allow them to work together as quantum bits, or "qubits," which serve simultaneously as the computer's processor and memory . By directing the interactions between qubits while keeping them isolated from the external environment, scientists enable a quantum computer to perform certain calculations, such as factoring, exponentially faster than conventional computers. When factoring large numbers using a conventional computer, each added digit roughly doubles the time to find the factors. In contrast, the quantum factoring time increases by only a constant increment with each additional digit.
This breakthrough completely renders useles the concept of the so-called one-way function, a function which can be executed in polynomial time, but whose inverse can be executed only in exponential time. Basically, this renders just about all public-key cryptographic functions obselete on one stroke.
Never underestimate the power of Nandrolone...
on
Cow Tipping is a Myth
·
· Score: 3, Interesting
From TFA:
Ms Boechler, now a trainee forensics analyst for the Royal Canadian Mounted Corps, concluded in her initial report that a cow standing with its legs straight would require five people to exert the required force to bowl it over.
Five normal people, perhaps...or perhaps just one college football jock, hopped up on steriods and Jagermeister...
(Before the naysayers start yammering about the misconceptions of steroid use, let me relate a personal experience of mine. Back in my college days, I watched my football jock roommate (an avowed Nandralone user) put his shoulder through the dorm room wall (concrete block), during a Jager bender. I doubt a mere cow would have had much of a chance against this guy.)
I thought the whole point of Wikipedia was that it was constantly changing...adapting...growing...evolving. A static version of Wikipedia obviates all of its advantages, while leaving its disadvantages (inaccuracies, vandalism, etc.) nicely intact.
The head of the software giant told the BBC that its ambition is to be bigger than Google in search
Yeah, and my ambition is to be an astronaut-playboy-robot-vampire that fights crime and plays lead guitar in his own thrash metal band on the weekends, but I don't think my ambition is terribly realistic either.
The NYT story is pretty light on the technical details....a more detail-oriented write-up can be found here... and you don't have to register to read it.
Here's a nice link for you...you'll need to have GreaseMonkey installed for it. Won't do you much good in this particular instance, but might help in the future.
"Look...the people you are harassing are the people you depend on. We fix your computers, we update your websites, we route your packets, we patch your servers, we guard your data while you sleep. Do not fuck with us."
Slashdot Mirror
Funny you should mention the discrete logarithm problem, given the fact that this scheme has suffered the same fate as factoring.
From the article referenced in the link: People here seem to think that this breakthrough is limited to factoring, when it's apparent that it's equally applicable to all one-way functions. All that's needed is to construct the appropriate algorithm, and have a quantum computer to run it on.
Here's an interesting snippet I found while perusing the PDF...thought I'd share.Interesting...Singularity is ostensibly supposed to be about stability, but the 44-page paper has no data on this. Kinda like saying, "Our new bulletproof vest is 40% lighter than our leading competitors, and twice as flexible. How well does it stop bullets, you ask? Sorry...we do not yet have results for that benchmark.".
Wake me when a paper comes out about Microsoft's new stability-oriented OS that actually addresses that particular aspect of the product.
Didn't we discuss this over a month ago???
Found this snippet here:Looks like the algorithm has already been found...just waiting for the hardware to run it on at this time.
Those Belgians...they're so damned evil...after all, they share a border with the Dutch. ^_^
Actually, no. The breakthrough here isn't just a much faster computer...if that was the cse, you'd be right...just increase the length of your encryption key to compensate. The breakthrough here is a computer capable of solving formerly exponentially-difficult functions in polynomial time, rather than exponential time. It completely rewrites the rules.
The summary is a bit fuzy on the details, but here's a telling excerpt from the IBM research article on their quantum computer (link here):
This breakthrough completely renders useles the concept of the so-called one-way function, a function which can be executed in polynomial time, but whose inverse can be executed only in exponential time. Basically, this renders just about all public-key cryptographic functions obselete on one stroke.
Interesting times...
Your insurance company must love you... ^_^
From TFA:Five normal people, perhaps...or perhaps just one college football jock, hopped up on steriods and Jagermeister...
(Before the naysayers start yammering about the misconceptions of steroid use, let me relate a personal experience of mine. Back in my college days, I watched my football jock roommate (an avowed Nandralone user) put his shoulder through the dorm room wall (concrete block), during a Jager bender. I doubt a mere cow would have had much of a chance against this guy.)
I thought the whole point of Wikipedia was that it was constantly changing...adapting...growing...evolving. A static version of Wikipedia obviates all of its advantages, while leaving its disadvantages (inaccuracies, vandalism, etc.) nicely intact.
In short, this is a dumb idea.
That's because you usually get the problem via Microsoft, and the answer via Google. ^_^
The head of the software giant told the BBC that its ambition is to be bigger than Google in search
Yeah, and my ambition is to be an astronaut-playboy-robot-vampire that fights crime and plays lead guitar in his own thrash metal band on the weekends, but I don't think my ambition is terribly realistic either.
The NYT story is pretty light on the technical details....a more detail-oriented write-up can be found here... and you don't have to register to read it.
Mabye you ought to RTFA:
From TFA:
I think I'm going to buy stock in Alcoa Operations...with shenanigans like this going on, they can only increase in value.
In the meantime, here's some telltale signs you might be under microwave surveillance:
Watch for these signs and protect your privacy...cause the government certainly isn't going to.
News from all over seems to indicate that Blue-Ray has been accepted by entertainment media groups.
Read: Pr0n industry.
No, CoolTechZone was hosed before that story as well...it's been down all day (see here for proof).
It's too bad editors don't check the links before posting a story....this sort of unpleasantness coould have been avoided twice today.
Here's a nice link for you...you'll need to have GreaseMonkey installed for it. Won't do you much good in this particular instance, but might help in the future.
Use Mirrordot!
And get the same error message as the original URL!
CoolTechZone.com being down is not due to the
Looks like CoolTechZone is down...second story today that the referenced article was unavailable...
Anyway, just so we have something to talk about...here's some info on WiMAX:
video gaming is a fun and affordable diversion, especially if you rent games or trade titles on the Internet.
So...is BusinessWeekOnline advocating that seniors pirate video games?
Thanks for the correction...I meant to type 1,050, but somehow, it came out 1,024....just have a thing for powers of 2, I guess... ^_^
No...
From the summary:
And from the referenced article:
If we assume the worst (150 m/day), the station will drop by 1,024 m in a week.