http://news.sciencemag.org/math/2015...plexity-theory

https://rjlipton.wordpress.com/2015/11/21/a-little-more-on-the-graph-isomorphism-algorithm/

http://www.technologyreview.com/news/543511/claimed-breakthrough-slays-classic-computing-problem-encryption-could-be-next/

https://www.newscientist.com/article/dn28478-complex-problem-made-simple-sends-computer-scientists-wild/

https://www.sciencenews.org/article/new-algorithm-cracks-graph-problem

"Solving an NP-complete problem, the impact on the speed of cryptographic systems and compressors is exponential.

The compressors are based on equality comparison in finite systems that are noted as binary in the archives, and the removal of material classified as equal;

Detecting equalities in an exponentially shorter time, inside in the existing arrangement in the file to be compressed - the compression and decompression speeds can increase exponentially over the best existing algorithms today."