4 ms·
The focus on computing power misses the forest for the trees. It's not about available computing power. It's about the intent. If you know decryption is possibl
by tedunangst 10y ago
The focus on computing power misses the forest for the trees. It's not about available computing power. It's about the intent. If you know decryption is possible, then "wink wink, it's encrypted" is a poor argument that the data wasn't published.
- AnthonyMouse 10y ago> It's about the intent. And now you've got yourself some trouble, because the intent for publishing the free speech flag can reasonably be as criticism of laws purporting to make certain information illegal. Then you're publishing political speech which is a whole different ballgame. But the better point is that people have become quick to dismiss the math, as if facts and logic and reality are irrelevant to the law. The law has to live inside the universe. It has to do something when the problems the math proves can happen actually do. So for example, the xor situation is interesting. If you xor with random bytes, the result is indistinguishable from random and is capable of encoding literally any information of equal or smaller length -- at the same time -- by changing what you xor it back with. So A xor B is the Declaration of Independence while A xor C is DeCSS, C xor D is the Bill of Rights and C xor E is a trade secret document. Now suppose there are some websites allowing anyone to publish xor-encoded data (or arbitrary data). Somebody uploads A to one such website and C to another. Anybody who asks about A, you can show them B and it encodes the Declaration of Independence. Anybody who asks about C, you can show them D and it encodes the Bill of Rights. So now A and C are being published by separate sites, each is indistinguishable from random, but xor them together and you get DeCSS. DeCSS is being published, but who is publishing it? Who can be forced to remove their half, when doing so would also delete arbitrarily many instances of lawful speech that require the same random bytes (and could be the only copy)? What is the status of B and D, given that you can xor them with public documents to get back A and C? What if you can prove that A is preexisting and C is derived from DeCSS and A? What if there is no way to prove which existed first? If somebody does this, there has to be an answer better than hand-wavy dismissal of inconvenient math.
- nl 10y agoYour XOR case is exactly the same example as the OP posted, just that the encryption algorithm involved the XOR operation, random bytes and another document. In court the judge would attempt to judge the intent of each person involved and rule based on that. You seem to think this is a problem, and indeed it is hard. That why the law uses judges rather than attempting to legislate every possible example. But the better point is that people have become quick to dismiss the math, as if facts and logic and reality are irrelevant to the law. The law has to live inside the universe. It has to do something when the problems the math proves can happen actually do. No. This is the key thing you are missing. Elsewhere on this thread someone put it like this: "I would add the concept that the law, unlike software, is capable of openly defying logic. Courts are permitted to dismiss case law and rule in a completely new and unforeseen direction." The Law is lazily evaluated, in a specific court, in the context of a specific case. It does not follow that the logic in one case applies in another - sometimes it might, sometimes it might not, and things like the intent of the people involved matter.
- AnthonyMouse 10y ago> Your XOR case is exactly the same example as the OP posted, just that the encryption algorithm involved the XOR operation, random bytes and another document. It isn't. If you encrypt something with most algorithms, there is going to be one key that turns it back into something intelligible and all the others produce garbage. That isn't the case with xor. Different "keys" will produce different intelligible decryptions. > In court the judge would attempt to judge the intent of each person involved and rule based on that. You seem to think this is a problem, and indeed it is hard. That why the law uses judges rather than attempting to legislate every possible example. The hardness is the problem. Suppose somebody sends you a DMCA takedown for what appears to be random numbers, arguing that if you xor it with some specific other random numbers you get infringing content. But that proves nothing because it's true for everything, so what are you supposed to do? What is the judge supposed to do? > No. This is the key thing you are missing. Elsewhere on this thread someone put it like this: "I would add the concept that the law, unlike software, is capable of openly defying logic. Courts are permitted to dismiss case law and rule in a completely new and unforeseen direction." How is that supposed to solve anything? The problem isn't that the court is going to come across "this statement is false" and have a meltdown, the problem is that we can't predict what the court is actually going to do so we don't know how to behave if we want to stay within the law. And furthermore that there isn't anything good for the court to do. Of course the court is not required to do something good, but how is it OK when they do something bad?