Are you sure about that ? I'm sure a certain government agency would beg to differ lol
Hah
If the encryption is implemented properly, then it does. Snowden said this as well - proper encryption is one of the only things, NSA cannot break yet.
I saw that someone has made a tool that attempts to bruteforce the common key by comparing hashes of randomly generated bytes with the f0f hash. I feel like it would work much better if it was sequential than random; it's like the tortoise and the hare.
Indeed sequential would most likely be better, but the keyspace is so huge that it doesnt make a difference anyway. The chance of just a single collision with the current speed of computers is abysmal.
If the key is 16 bytes (128 bit), which I saw someone write earlier, it would take more than just a few years to bruteforce it.
My home computer can bruteforce about 2^36 (36 bits) of key-combinations per year. However its from 2008, and its safe to assume that a private person can bruteforce a key of about 2^40 bits per year.
Since a key of 41 bits takes double the length to bruteforce etc., a key of 128 bits would take 309485009821345068724781056 years to bruteforce... Even if we used the cloud, and we assumed it was 1 billion times stronger than our home pc (which it isn't), it would take around 309485009821345068 years bruteforcing it.
Bruteforcing is NOT feasible of a key of this length, granted the underlying cryptographic primitives has been implemented properly.
I do not know which encryption algorithm that has been used for this, but I would guess its likely AES128 if its symmetric or some elliptic curve if its asymmetric (public/private key based).
There are no feasible way to break any of these. The best attack on AES128 takes around 2^126.tries. I know... because the two guys that invented the attack, has both been my teachers
(and I wrote the wiki article on it:
http://en.wikipedia.org/wiki/Biclique_attack :3 )