Math discoveries in SOME cases lol okay like?
Just because there is a way to somewhat shorten the amount of time it may take to crack a key or anonymity doesn't mean that it can't be mitigated in a simple way as using a longer key length.
Just because there is a way to somewhat shorten the amount of time it may take to crack a key or anonymity doesn't mean that it can't be mitigated in a simple way as using a longer key length.
Perhaps you forgot about the discovery of differential cryptanalysis that rendered all 1970s and 1980s crypto cracked (and no one knew it!).
Can't you read?
http://cacm.acm.org/news/170850-french-team-invents-faster-code-breaking-algorithm/fulltext#body-3
Quote
The Future
Barbulescu says the research group has considered trying to push its ideas to medium- and large-characteristic systems, "but there is a huge difficulty porting this algorithm to these other cases," he says. "But if we were able to extend it to large characteristic, then it would be an earthquake in cryptography because every time there is an improvement in discrete logarithm, there is a corresponding improvement in factorization (RSA), because the problems are similar."
Meanwhile, though, existing RSA-based systems should be considered secure. "There are some buzz articles floating around on the Web saying that this is the endgame for RSA," Thomé says. "It is wrong to say that."
The University of Waterloo's Menezes says he is not aware of any cryptosystems in use today that are suddenly at risk because of the work by the French team. However, he warns, "There will be faster algorithms, better implementations of the existing algorithm perhaps through special-purpose hardware, and better analysis. Maybe the algorithms are faster than we think they are."
Barbulescu says the research group has considered trying to push its ideas to medium- and large-characteristic systems, "but there is a huge difficulty porting this algorithm to these other cases," he says. "But if we were able to extend it to large characteristic, then it would be an earthquake in cryptography because every time there is an improvement in discrete logarithm, there is a corresponding improvement in factorization (RSA), because the problems are similar."
Meanwhile, though, existing RSA-based systems should be considered secure. "There are some buzz articles floating around on the Web saying that this is the endgame for RSA," Thomé says. "It is wrong to say that."
The University of Waterloo's Menezes says he is not aware of any cryptosystems in use today that are suddenly at risk because of the work by the French team. However, he warns, "There will be faster algorithms, better implementations of the existing algorithm perhaps through special-purpose hardware, and better analysis. Maybe the algorithms are faster than we think they are."
Why can't you understand that once it is broken, you can't go back and hide the history on the block chain.
What ever you've already released to the block chain, is never going to get more secure. It WILL BE CRACKED SOMEDAY.
That is why do not put your anonymity on the block chain. Mix your inputs and outputs off chain, then put that in a transaction on the block chain (i.e. use CoinJoin).
Then the anonymity can never be cracked in the way it can be on chain with Cryptonote's ring signatures and Diffie-Hellman one-time private keys.
I hope I don't have to explain that again and again.
Boollion. That should get that Keiser guy's attention, I suppose. 
I think I was the first to suggest that?