The phenomenal success of our integrated circuits managed to obscure an awkward fact: they're not always the best way to solve problems. The features of modern computers—binary operations, separated ...

This obviously would render all prime-factor based cryptography algorithms obsolete. I have warned the FBI about this for a while, however; what everyone wanted from me was an algorithm that does ...

Scientists at IBM's Almaden Research Center have performed the world's most complicated quantum-computer calculation to date. They caused a billion billion custom-designed molecules in a test tube to ...

Quantum factor: the Paul trap used by Monz and colleagues. (Courtesy: C Lackner/Quantum Optics and Spectroscopy Group, University of Innsbruck) A quantum computer made of five trapped ions has been ...

As well as being incredibly fascinating, quantum mechanics is also set to revolutionize the fields of information theory and computation. There exist certain problems that could be solved using a ...

Peter Shor didn’t set out to break the internet. But an algorithm he developed in the mid-1990s threatened to do just that. In a landmark paper, Shor showed how a hypothetical computer that exploited ...

A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...

SIAM Journal on Numerical Analysis, Vol. 11, No. 6 (Dec., 1974), pp. 1087-1104 (18 pages) A composite algorithm has been designed for finding zeros of real polynomials. The algorithm has proved to be ...