Quantum computers may one day be able to decrypt standard encryption by factoring large prime numbers. As far as I know, the NSA doesn't yet have this technology, but the implications are astounding.
Prime number factoring is so 20th Century. Now days, the cool kids use elliptic curve cryptography.
<pedant>Encoded messages need to be decoded, not decrypted.</pedant>
Also, certainly not true. One Time Pad cannot be decrypted without the pad used.
----------
It cannot be brute forced, due to the reasons you state. The algorithm used may be vulnerable to other forms of cryptanalysis.
Just for that "pedant" comment, UNCRIPTED.
One time pad encryption can be decrypted. Unfortunately, it can be decrypted to give you any message you want, with the correct one having no greater weight. If the one time pad becomes a two time pad, all bets are off.
When I was a kid, I wrote a one time pad program that would let you encrypt a message, then, you gave it a second message and it would generate a key to decode the first message, giving you the second.
256 bit encryption can be broken, if you use large clusters of computers, for a long time. (Think folding@home). Each bit you add doubles the amount of time needed to break the encryption. If I remember, 1024 bit encryption could not be broken by every computer ever built, before the sun runs out of fuel.