Re: [PrimeNumbers] demonstration of quantum computing for factoring
Shoup presents us with a polynomial time factoring
algorithm using quantum computers. Its still not known
if such a powerful computer can be made but NIST's
announcement points out this may be possible. You may
be interested in looking at this.
--- Mark Underwood <mark.underwood@...>
> Found a good news article athttp://www.nist.gov/public_affairs/releases/fourier.htm
> part of which is below. The whole article goes into
> more detail
> regarding how the quantum Fourier transform works.
Have fun online with music videos, cool games, IM and more. Check it out!
- Its Shor and not Shoup.
Do you Yahoo!?
Yahoo! Mail - You care about security. So do we.