Rationale for a data corrupter?
	Robert Fahy
	April 11th 2011


	No, this is not a serious thesis, but the fruit of thought on a beautiful Monday noon.
	I was thinking about quantum computers. A couple dozen years from now I imagine they could be consumer items, replacing the digital personal computers. I can't dwell into the science of quantum processors because quite frankly the physics behind it evade me, but also because that's not the point of interest in this writing.
	What quantum computers will bring is processing power, and lots of it. While some mathematicians analyze how a quantum computer could break existing encryption algorithms, I am more concerned about the simplest practical application of the increase in processing speed: brute-forcing.
	The problem that brute-forcing represents is that it does not attack the encryption algorithm itself. The algorithm's strength becomes irrelevant. While I know that real life technology will always be limited by physics, and in practice infinitely high speeds would not be achievable, I prefer to consider that the adversary's quantum computer has an almost-infinite processing speed. Nowadays the biggest impediment to brute-forcing is time, but how can the technique be fought if the time it requires is almost zero?
	And that is why I started writing this. I don't have an answer. And some of the points I made above could be fallacious, but this is not an issue I will forget about and abandon...
