I read from Finnish newspaper ( http://www.uusisuomi.fi/tiede-ja-ymparisto/72212-matemaattinen-ongelma-eli-2-300-vuotta-mies-subway-tiskin-takaa-ratkaisi#.VBwhYp09F2k.facebook ) the article of Zhang's results that there are infinitely many prime pairs $(p_1,p_2)$ where $p_2-p_1=70000000$ the following:
Zhang's breakthrough made cracking the RSA-cryptography a bit easier. In reality, RSA is still a strong protection, and one gets million dollar prize if one cracks it.
Is this RSA-part true? I guess there is one mistake and it should be that $0<p_2-p_1\leq 70000000$.
The result proves what everybody expected anyway. If one wants to crack something you can assume whatever seems reasonable (oversimplifying a bit). The claim seems dubious or imprecise at best.
Added: I just had a look at that article (to be precise, an automatic translation of it). It does not say much specific and I really think it can be ignored. For one thing, nowhere are the key-sizes made precise for RSA being broken or being still save and so on. This is a huge red-flag as with too short keys RSA is completely unsafe. Thus the claim does not mean much at all.
Further to claims, for good balance a claim is made that the Petangon (whatever this is supposed to mean precisely) might or might not be able to crack RSA.
In sum, I would not pay much attention to the math content of that article.