Quote:
Originally posted by phukraut
sure it has, algorithm efficiency plays a big role in cutting down the number of cases to check. there is math involved in finding out the best way to approach a brute force attack. this does open up new possibilities.
|
There were no new algorithms developed to solve these problems.
Any mathemetician or programmer knows how it is improbable (really impossible) to find large prime numbers efficiently. If an algorithm had been developed it would be some big ass news because modern cryptography would be ruined.
Number 2:"Bill Cutler used a computer program to enumerate all solutions."
Number 3:"This longstanding open problem has now been settled in the negative by an exhaustive computer enumeration of all possibilities."
Enumeration isn't an efficient way of doing things and anyone could have done it years ago, they just would have taken forever to get the results.
In the case of prime numbers you would have to wait a few hundred (thousand?) years on a 486.