This should not have been modded up, because it is blatantly false. The security of ECC relies on the presumed hardness of the discrete logarithm problem (in elliptic curves over finite fields). But Shor's algorithm can solve the discrete logarithm problem in ANY finite group (assuming you have an efficient way of operating on the group elements).

C++0xB is a cleverer name since it can be interpreted in two ways:
1) Since C++0x wasn't completed in 200x as expected, it's time for plan B, namely C++0xB.
2) 0xB represents 11, since 0x is the prefix for hexadecimal in C++. And so C++0xB still literally means the version finalised in 2011.

You can see a sample of his handwriting in an interview he did with Free Software Magazine in 2005: http://www.freesoftwaremagazine.com/articles/interview_knuth