Louis de Branges Publishes Proof of the Riemann Hypothesis

What does that mean to you? Well, in the long run it means that encryption used in e-commerce is breakable (in theory). Strong encryption was (still is) considered impossible to break (i.e. will take you forever to solve it! Nothing is impossible!)... but the proof of Riemann Hypothesis suggests connections in apparently random sets of prime numbers. Large prime numbers are considered the basis of some of the worlds most secure cryptographic algorithms and therefore any prediction of relations between them could lead to breaking encryption based on them. For more read E-Commerce times. For the actual paper go to the Dr's page linked below.