>In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10^100.
>The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve.
What's the likelihood this is actually true, versus the likelihood the NSA, KGB, Mossad, etc has some top secret faster classical algorithm that simply hasnt been discovered publically? Do we have historical evidence of this kind of thing, purely mathematical discoveries being kept secret by the governments who discover them?
>The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve.
What's the likelihood this is actually true, versus the likelihood the NSA, KGB, Mossad, etc has some top secret faster classical algorithm that simply hasnt been discovered publically? Do we have historical evidence of this kind of thing, purely mathematical discoveries being kept secret by the governments who discover them?
