The only way that this claim could be true is if someone's been hiding a
quantum computer capable of running for on the order of 2^64 steps required
by Grover search -- technology that is 10+ years out at best and probably
considerably more -- for over a decade. That seems highly unlikely.
Even then it is somewhat debatable whether Grover's algorithm would qualify
-- while the intent of the claim is clearly about "exhaustively searching
the keyspace" the wording of the claim overspecifies "exhaustive search" in
a manner that may exclude Grover search. It is hard to blame the author
here -- the question predates 1995 and Grover's algorithm wasn't published
> Cr28: "A cryptographic key of 128 bits or longer will be broken, by
> exhaustively searching the keyspace, before 2010 UT. "
> I've done a little bit of research, and looked at the state of the
> market. I've found no evidence that the net thinks that 128 bit keys
> will be in range in the near future, and this claim is about events at
> least 10 years ago. The (FX) market seems to agree: there are only
> orders to sell, and the last transaction was at a price of 1.
> If no one presents evidence to the contrary, I'll resolve this question
> next weekend.
> All sensory cells [in all animals] have in common the presence of
> ... cilia [with a constant] structure. It provides a strong
> argument for common ancestry. The common ancestor ... was a
> spirochete bacterium.
> --Lynn Margulis (http://edge.org/q2005/q05_7.html#margulis)
> Chris Hibbert
> Blog: http://www.pancrit.org
> Twitter: C_Hibbert_reads