DVD CCA Emergency Hearing to seal DeCSS

Anonymous Coward writes "The DVD CCA notified the defense lawyers on Tuesday that they are seeking an emergency ex parte motion to seal Hoy Exhibit B, which has been up at John Young's Cryptome for days, and was mentioned on Slashdot on Monday. This will be heard at an emergency hearing at 8:30 a.m. Wednesday, Jan. 26, at the usual Santa Clara County Courthouse in San Jose, in Judge Elfving's court. If you're reading Slashdot before breakfast and you're near San Jose, it's time to come on down!"

Comments

Why is everything last minute

[ajs]

It seems like part of the strategy here is to keep the community off-balance by scheduling everything too fast for us to keep up. Why does our legal system allow for this?

Re:Why is everything last minute

[doogles]

In a world where it normally takes months and months to have a hearing, it's interesting that all it takes is a few billion dollars behind you and you can get a hearing in a matter of hours.

Re:Too fast -- too slow -- just right?

[werdna]

I'll stand by my previous statement that the present motion is both routine and not unconcionable. In a legal action disputing whether subject matter is trade secret, it is routine and proper that publicly availalbe files containing the subject matter of the lawsuit be redacted to exclude the subject matter of the suit. When this is overlooked, for whatever reason, it is common to make an emergency motion to seal it -- and such motions are commonly granted.

You may choose to take the position that anything that is done by MPAA concerning the lawsuit is unconcionable -- this is a common view in this community. However, going ballistic over routine motions will simply get you ignored as one who "always cries wolf" when you go ballistic over the real ones.

Assume for the sake of the argument that the subject matter *WAS* a trade secret. If so, having the court files containing the subject matter (if indeed it did contain the subject matter) laid open to the public is a grievous technical error that should be immediately corrected.

The motion was routinely made and probably will be routinely granted. I can't think of any meaningful defense to this motion(particularly since a P.I. was already granted) except, perhaps, that the declaration does not contain subject matter claimed to be secret. In that case, no more than a few hours notice is necessary to prepare the appropriate papers and to appear for hearing.

And no, I'm not defending the plaintiff's position. I'm not fond of what they are doing either. I'm just saying it would be best for the credibility of the committee to call a spade a spade and save their vitreol for the really bad stuff.

There is an amazing power in the advocacy of making concessions. If you give to others what is theirs, particularly before the Court, then when you do ask for things, the Court sits at attention. If you oppose EVERY motion, and gainsay EVERY argument, you will eventually get tuned out. This is particularly true when, looking at things practically and objectively, you can't win the motion.

Unless facts and California public records and trade secret law is substantially different from the reports, it is time to say, "Your honor, assuming their allegations were true, of course this motion must be granted -- the fact that they let this happen is proof, indeed an admission, that this plaintiff doesn't take reasonable precautions to preserve secrecy of that information, and that is why we must ultimately prevail on the merits. But for the record, we do not oppose this emergency motion."

To win in disputes like these, you have to stay very cool, you have to judge the judge, and you have to stay credible. I am reminded of an excellent story about the New York case in which West Publications tried to keep others from making a database with citations to legal materials in West Reporters, using page numbers. After West's lawyer argued at length (well over the allotted hour), the exhausted Judge turned to the defendant and a hero lawyer said something like the following:

"Your honor, the plaintiff claims copyright protection of the numbers 1, 2, 3 and so forth in sequence. We find this an astonishing position and have nothing to add to our briefs."

He then did the most important thing a lawyer can do -- "he sat down." He knew when it was important to speak, and when to shut up. Interestingly, that lawyer won that case with that brief argument, when several other lawyers (including a friend of mine who handled a case in Minnesota on the same issues with a different defendant) failed on the same issue.

Stay cool! Direct your rage appropriately. Ignore the silliness when they overreach and it doesn't matter, or look for ways to use your advantage at another time. Then, when it is right, use it to best effect. Advocacy is much more effective that way.

petition against the treatment of Jon Johanson

[LazyGun]

A Norwegian Linux web site, have started a petition against the treatment of Jon Johanson Sign the petition against the treatment received by Jon Johanson! http://linuxguiden.linpro.no/protesteng.php

Re:This is comedy!

[gorilla]

Not legal for people in the US to distribute the info.

People outside of the US are not affected in any way.

DeCSS

[Anonymous Coward]

YOU CAN'T STOP ME!!!!!!!!!!!!!!!!!











css-auth.h
----------
typedef unsigned char byte;
struct block {
byte b[5];
};

extern void CryptKey1(int varient, byte const *challenge, struct block *key);
extern void CryptKey2(int varient, byte const *challenge, struct block *key);
extern void CryptBusKey(int varient, byte const *challenge, struct block *key);

css-auth.c
----------
/*
* Copyright (C) 1999 Derek Fawcus
*
* This code may be used under the terms of Version 2 of the GPL,
* read the file COPYING for details.
*
*/

/*
* These routines do some reordering of the supplied data before
* calling engine() to do the main work.
*
* The reordering seems similar to that done by the initial stages of
* the DES algorithm, in that it looks like it's just been done to
* try and make software decoding slower. I'm not sure that it
* actually adds anything to the security.
*
* The nature of the shuffling is that the bits of the supplied
* parameter 'varient' are reorganised (and some inverted), and
* the bytes of the parameter 'challenge' are reorganised.
*
* The reorganisation in each routine is different, and the first
* (CryptKey1) does not bother of play with the 'varient' parameter.
*
* Since this code is only run once per disk change, I've made the
* code table driven in order to improve readability.
*
* Since these routines are so similar to each other, one could even
* abstract them all to one routine supplied a parameter determining
* the nature of the reordering it has to do.
*/

#include "css-auth.h"

typedef unsigned long u32;

static void engine(int varient, byte const *input, struct block *output);

void CryptKey1(int varient, byte const *challenge, struct block *key)
{
static byte perm_challenge[] = {1,3,0,7,5, 2,9,6,4,8};

byte scratch[10];
int i;

for (i = 9; i >= 0; --i)
scratch[i] = challenge[perm_challenge[i]];

engine(varient, scratch, key);
}

/* This shuffles the bits in varient to make perm_varient such that
* 4 -> !3
* 3 -> 4
* varient bits: 2 -> 0 perm_varient bits
* 1 -> 2
* 0 -> !1
*/
void CryptKey2(int varient, byte const *challenge, struct block *key)
{
static byte perm_challenge[] = {6,1,9,3,8, 5,7,4,0,2};

static byte perm_varient[] = {
0x0a, 0x08, 0x0e, 0x0c, 0x0b, 0x09, 0x0f, 0x0d,
0x1a, 0x18, 0x1e, 0x1c, 0x1b, 0x19, 0x1f, 0x1d,
0x02, 0x00, 0x06, 0x04, 0x03, 0x01, 0x07, 0x05,
0x12, 0x10, 0x16, 0x14, 0x13, 0x11, 0x17, 0x15};

byte scratch[10];
int i;

for (i = 9; i >= 0; --i)
scratch[i] = challenge[perm_challenge[i]];

engine(perm_varient[varient], scratch, key);
}

/* This shuffles the bits in varient to make perm_varient such that
* 4 -> 0
* 3 -> !1
* varient bits: 2 -> !4 perm_varient bits
* 1 -> 2
* 0 -> 3
*/
void CryptBusKey(int varient, byte const *challenge, struct block *key)
{
static byte perm_challenge[] = {4,0,3,5,7, 2,8,6,1,9};
static byte perm_varient[] = {
0x12, 0x1a, 0x16, 0x1e, 0x02, 0x0a, 0x06, 0x0e,
0x10, 0x18, 0x14, 0x1c, 0x00, 0x08, 0x04, 0x0c,
0x13, 0x1b, 0x17, 0x1f, 0x03, 0x0b, 0x07, 0x0f,
0x11, 0x19, 0x15, 0x1d, 0x01, 0x09, 0x05, 0x0d};

byte scratch[10];
int i;

for (i = 9; i >= 0; --i)
scratch[i] = challenge[perm_challenge[i]];

engine(perm_varient[varient], scratch, key);
}

/*
* We use two LFSR's (seeded from some of the input data bytes) to
* generate two streams of pseudo-random bits. These two bit streams
* are then combined by simply adding with carry to generate a final
* sequence of pseudo-random bits which is stored in the buffer that
* 'output' points to the end of - len is the size of this buffer.
*
* The first LFSR is of degree 25, and has a polynomial of:
* x^13 + x^5 + x^4 + x^1 + 1
*
* The second LSFR is of degree 17, and has a (primitive) polynomial of:
* x^15 + x^1 + 1
*
* I don't know if these polynomials are primitive modulo 2, and thus
* represent maximal-period LFSR's.
*
*
* Note that we take the output of each LFSR from the new shifted in
* bit, not the old shifted out bit. Thus for ease of use the LFSR's
* are implemented in bit reversed order.
*
*/
static void generate_bits(byte *output, int len, struct block const *s)
{
u32 lfsr0, lfsr1;
byte carry;

/* In order to ensure that the LFSR works we need to ensure that the
* initial values are non-zero. Thus when we initialise them from
* the seed, we ensure that a bit is set.
*/
lfsr0 = (s->b[0] b[1] b[2] & ~7) b[2] & 7);
lfsr1 = (s->b[3] b[4];

++output;

carry = 0;
do {
int bit;
byte val;

for (bit = 0, val = 0; bit > 24) ^ (lfsr0 >> 21) ^ (lfsr0 >> 20) ^ (lfsr0 >> 12)) & 1;
lfsr0 = (lfsr0 > 16) ^ (lfsr1 >> 2)) & 1;
lfsr1 = (lfsr1 > 1) & 1)

combined = !o_lfsr1 + carry + !o_lfsr0;
carry = BIT1(combined);
val |= BIT0(combined) 0);
}

static byte Secret[];
static byte Varients[];
static byte Table0[];
static byte Table1[];
static byte Table2[];
static byte Table3[];

/*
* This encryption engine implements one of 32 variations
* one the same theme depending upon the choice in the
* varient parameter (0 - 31).
*
* The algorithm itself manipulates a 40 bit input into
* a 40 bit output.
* The parameter 'input' is 80 bits. It consists of
* the 40 bit input value that is to be encrypted followed
* by a 40 bit seed value for the pseudo random number
* generators.
*/
static void engine(int varient, byte const *input, struct block *output)
{
byte cse, term, index;
struct block temp1;
struct block temp2;
byte bits[30];

int i;

/* Feed the secret into the input values such that
* we alter the seed to the LFSR's used above, then
* generate the bits to play with.
*/
for (i = 5; --i >= 0; )
temp1.b[i] = input[5 + i] ^ Secret[i] ^ Table2[i];

generate_bits(&bits[29], sizeof bits, &temp1);

/* This term is used throughout the following to
* select one of 32 different variations on the
* algorithm.
*/
cse = Varients[varient] ^ Table2[varient];

/* Now the actual blocks doing the encryption. Each
* of these works on 40 bits at a time and are quite
* similar.
*/
for (i = 5, term = 0; --i >= 0; term = input[i]) {
index = bits[25 + i] ^ input[i];
index = Table1[index] ^ ~Table2[index] ^ cse;

temp1.b[i] = Table2[index] ^ Table3[index] ^ term;
}
temp1.b[4] ^= temp1.b[0];

for (i = 5, term = 0; --i >= 0; term = temp1.b[i]) {
index = bits[20 + i] ^ temp1.b[i];
index = Table1[index] ^ ~Table2[index] ^ cse;

temp2.b[i] = Table2[index] ^ Table3[index] ^ term;
}
temp2.b[4] ^= temp2.b[0];

for (i = 5, term = 0; --i >= 0; term = temp2.b[i]) {
index = bits[15 + i] ^ temp2.b[i];
index = Table1[index] ^ ~Table2[index] ^ cse;
index = Table2[index] ^ Table3[index] ^ term;

temp1.b[i] = Table0[index] ^ Table2[index];
}
temp1.b[4] ^= temp1.b[0];

for (i = 5, term = 0; --i >= 0; term = temp1.b[i]) {
index = bits[10 + i] ^ temp1.b[i];
index = Table1[index] ^ ~Table2[index] ^ cse;

index = Table2[index] ^ Table3[index] ^ term;

temp2.b[i] = Table0[index] ^ Table2[index];
}
temp2.b[4] ^= temp2.b[0];

for (i = 5, term = 0; --i >= 0; term = temp2.b[i]) {
index = bits[5 + i] ^ temp2.b[i];
index = Table1[index] ^ ~Table2[index] ^ cse;

temp1.b[i] = Table2[index] ^ Table3[index] ^ term;
}
temp1.b[4] ^= temp1.b[0];

for (i = 5, term = 0; --i >= 0; term = temp1.b[i]) {
index = bits[i] ^ temp1.b[i];
index = Table1[index] ^ ~Table2[index] ^ cse;

output->b[i] = Table2[index] ^ Table3[index] ^ term;
}
}

static byte Varients[] = {
0xB7, 0x74, 0x85, 0xD0, 0xCC, 0xDB, 0xCA, 0x73,
0x03, 0xFE, 0x31, 0x03, 0x52, 0xE0, 0xB7, 0x42,
0x63, 0x16, 0xF2, 0x2A, 0x79, 0x52, 0xFF, 0x1B,
0x7A, 0x11, 0xCA, 0x1A, 0x9B, 0x40, 0xAD, 0x01};

static byte Secret[] = {0x55, 0xD6, 0xC4, 0xC5, 0x28};

static byte Table0[] = {
0xB7, 0xF4, 0x82, 0x57, 0xDA, 0x4D, 0xDB, 0xE2,
0x2F, 0x52, 0x1A, 0xA8, 0x68, 0x5A, 0x8A, 0xFF,
0xFB, 0x0E, 0x6D, 0x35, 0xF7, 0x5C, 0x76, 0x12,
0xCE, 0x25, 0x79, 0x29, 0x39, 0x62, 0x08, 0x24,
0xA5, 0x85, 0x7B, 0x56, 0x01, 0x23, 0x68, 0xCF,
0x0A, 0xE2, 0x5A, 0xED, 0x3D, 0x59, 0xB0, 0xA9,
0xB0, 0x2C, 0xF2, 0xB8, 0xEF, 0x32, 0xA9, 0x40,
0x80, 0x71, 0xAF, 0x1E, 0xDE, 0x8F, 0x58, 0x88,
0xB8, 0x3A, 0xD0, 0xFC, 0xC4, 0x1E, 0xB5, 0xA0,
0xBB, 0x3B, 0x0F, 0x01, 0x7E, 0x1F, 0x9F, 0xD9,
0xAA, 0xB8, 0x3D, 0x9D, 0x74, 0x1E, 0x25, 0xDB,
0x37, 0x56, 0x8F, 0x16, 0xBA, 0x49, 0x2B, 0xAC,
0xD0, 0xBD, 0x95, 0x20, 0xBE, 0x7A, 0x28, 0xD0,
0x51, 0x64, 0x63, 0x1C, 0x7F, 0x66, 0x10, 0xBB,
0xC4, 0x56, 0x1A, 0x04, 0x6E, 0x0A, 0xEC, 0x9C,
0xD6, 0xE8, 0x9A, 0x7A, 0xCF, 0x8C, 0xDB, 0xB1,
0xEF, 0x71, 0xDE, 0x31, 0xFF, 0x54, 0x3E, 0x5E,
0x07, 0x69, 0x96, 0xB0, 0xCF, 0xDD, 0x9E, 0x47,
0xC7, 0x96, 0x8F, 0xE4, 0x2B, 0x59, 0xC6, 0xEE,
0xB9, 0x86, 0x9A, 0x64, 0x84, 0x72, 0xE2, 0x5B,
0xA2, 0x96, 0x58, 0x99, 0x50, 0x03, 0xF5, 0x38,
0x4D, 0x02, 0x7D, 0xE7, 0x7D, 0x75, 0xA7, 0xB8,
0x67, 0x87, 0x84, 0x3F, 0x1D, 0x11, 0xE5, 0xFC,
0x1E, 0xD3, 0x83, 0x16, 0xA5, 0x29, 0xF6, 0xC7,
0x15, 0x61, 0x29, 0x1A, 0x43, 0x4F, 0x9B, 0xAF,
0xC5, 0x87, 0x34, 0x6C, 0x0F, 0x3B, 0xA8, 0x1D,
0x45, 0x58, 0x25, 0xDC, 0xA8, 0xA3, 0x3B, 0xD1,
0x79, 0x1B, 0x48, 0xF2, 0xE9, 0x93, 0x1F, 0xFC,
0xDB, 0x2A, 0x90, 0xA9, 0x8A, 0x3D, 0x39, 0x18,
0xA3, 0x8E, 0x58, 0x6C, 0xE0, 0x12, 0xBB, 0x25,
0xCD, 0x71, 0x22, 0xA2, 0x64, 0xC6, 0xE7, 0xFB,
0xAD, 0x94, 0x77, 0x04, 0x9A, 0x39, 0xCF, 0x7C};

static byte Table1[] = {
0x8C, 0x47, 0xB0, 0xE1, 0xEB, 0xFC, 0xEB, 0x56,
0x10, 0xE5, 0x2C, 0x1A, 0x5D, 0xEF, 0xBE, 0x4F,
0x08, 0x75, 0x97, 0x4B, 0x0E, 0x25, 0x8E, 0x6E,
0x39, 0x5A, 0x87, 0x53, 0xC4, 0x1F, 0xF4, 0x5C,
0x4E, 0xE6, 0x99, 0x30, 0xE0, 0x42, 0x88, 0xAB,
0xE5, 0x85, 0xBC, 0x8F, 0xD8, 0x3C, 0x54, 0xC9,
0x53, 0x47, 0x18, 0xD6, 0x06, 0x5B, 0x41, 0x2C,
0x67, 0x1E, 0x41, 0x74, 0x33, 0xE2, 0xB4, 0xE0,
0x23, 0x29, 0x42, 0xEA, 0x55, 0x0F, 0x25, 0xB4,
0x24, 0x2C, 0x99, 0x13, 0xEB, 0x0A, 0x0B, 0xC9,
0xF9, 0x63, 0x67, 0x43, 0x2D, 0xC7, 0x7D, 0x07,
0x60, 0x89, 0xD1, 0xCC, 0xE7, 0x94, 0x77, 0x74,
0x9B, 0x7E, 0xD7, 0xE6, 0xFF, 0xBB, 0x68, 0x14,
0x1E, 0xA3, 0x25, 0xDE, 0x3A, 0xA3, 0x54, 0x7B,
0x87, 0x9D, 0x50, 0xCA, 0x27, 0xC3, 0xA4, 0x50,
0x91, 0x27, 0xD4, 0xB0, 0x82, 0x41, 0x97, 0x79,
0x94, 0x82, 0xAC, 0xC7, 0x8E, 0xA5, 0x4E, 0xAA,
0x78, 0x9E, 0xE0, 0x42, 0xBA, 0x28, 0xEA, 0xB7,
0x74, 0xAD, 0x35, 0xDA, 0x92, 0x60, 0x7E, 0xD2,
0x0E, 0xB9, 0x24, 0x5E, 0x39, 0x4F, 0x5E, 0x63,
0x09, 0xB5, 0xFA, 0xBF, 0xF1, 0x22, 0x55, 0x1C,
0xE2, 0x25, 0xDB, 0xC5, 0xD8, 0x50, 0x03, 0x98,
0xC4, 0xAC, 0x2E, 0x11, 0xB4, 0x38, 0x4D, 0xD0,
0xB9, 0xFC, 0x2D, 0x3C, 0x08, 0x04, 0x5A, 0xEF,
0xCE, 0x32, 0xFB, 0x4C, 0x92, 0x1E, 0x4B, 0xFB,
0x1A, 0xD0, 0xE2, 0x3E, 0xDA, 0x6E, 0x7C, 0x4D,
0x56, 0xC3, 0x3F, 0x42, 0xB1, 0x3A, 0x23, 0x4D,
0x6E, 0x84, 0x56, 0x68, 0xF4, 0x0E, 0x03, 0x64,
0xD0, 0xA9, 0x92, 0x2F, 0x8B, 0xBC, 0x39, 0x9C,
0xAC, 0x09, 0x5E, 0xEE, 0xE5, 0x97, 0xBF, 0xA5,
0xCE, 0xFA, 0x28, 0x2C, 0x6D, 0x4F, 0xEF, 0x77,
0xAA, 0x1B, 0x79, 0x8E, 0x97, 0xB4, 0xC3, 0xF4};

static byte Table2[] = {
0xB7, 0x75, 0x81, 0xD5, 0xDC, 0xCA, 0xDE, 0x66,
0x23, 0xDF, 0x15, 0x26, 0x62, 0xD1, 0x83, 0x77,
0xE3, 0x97, 0x76, 0xAF, 0xE9, 0xC3, 0x6B, 0x8E,
0xDA, 0xB0, 0x6E, 0xBF, 0x2B, 0xF1, 0x19, 0xB4,
0x95, 0x34, 0x48, 0xE4, 0x37, 0x94, 0x5D, 0x7B,
0x36, 0x5F, 0x65, 0x53, 0x07, 0xE2, 0x89, 0x11,
0x98, 0x85, 0xD9, 0x12, 0xC1, 0x9D, 0x84, 0xEC,
0xA4, 0xD4, 0x88, 0xB8, 0xFC, 0x2C, 0x79, 0x28,
0xD8, 0xDB, 0xB3, 0x1E, 0xA2, 0xF9, 0xD0, 0x44,
0xD7, 0xD6, 0x60, 0xEF, 0x14, 0xF4, 0xF6, 0x31,
0xD2, 0x41, 0x46, 0x67, 0x0A, 0xE1, 0x58, 0x27,
0x43, 0xA3, 0xF8, 0xE0, 0xC8, 0xBA, 0x5A, 0x5C,
0x80, 0x6C, 0xC6, 0xF2, 0xE8, 0xAD, 0x7D, 0x04,
0x0D, 0xB9, 0x3C, 0xC2, 0x25, 0xBD, 0x49, 0x63,
0x8C, 0x9F, 0x51, 0xCE, 0x20, 0xC5, 0xA1, 0x50,
0x92, 0x2D, 0xDD, 0xBC, 0x8D, 0x4F, 0x9A, 0x71,
0x2F, 0x30, 0x1D, 0x73, 0x39, 0x13, 0xFB, 0x1A,
0xCB, 0x24, 0x59, 0xFE, 0x05, 0x96, 0x57, 0x0F,
0x1F, 0xCF, 0x54, 0xBE, 0xF5, 0x06, 0x1B, 0xB2,
0x6D, 0xD3, 0x4D, 0x32, 0x56, 0x21, 0x33, 0x0B,
0x52, 0xE7, 0xAB, 0xEB, 0xA6, 0x74, 0x00, 0x4C,
0xB1, 0x7F, 0x82, 0x99, 0x87, 0x0E, 0x5E, 0xC0,
0x8F, 0xEE, 0x6F, 0x55, 0xF3, 0x7E, 0x08, 0x90,
0xFA, 0xB6, 0x64, 0x70, 0x47, 0x4A, 0x17, 0xA7,
0xB5, 0x40, 0x8A, 0x38, 0xE5, 0x68, 0x3E, 0x8B,
0x69, 0xAA, 0x9B, 0x42, 0xA5, 0x10, 0x01, 0x35,
0xFD, 0x61, 0x9E, 0xE6, 0x16, 0x9C, 0x86, 0xED,
0xCD, 0x2E, 0xFF, 0xC4, 0x5B, 0xA0, 0xAE, 0xCC,
0x4B, 0x3B, 0x03, 0xBB, 0x1C, 0x2A, 0xAC, 0x0C,
0x3F, 0x93, 0xC7, 0x72, 0x7A, 0x09, 0x22, 0x3D,
0x45, 0x78, 0xA9, 0xA8, 0xEA, 0xC9, 0x6A, 0xF7,
0x29, 0x91, 0xF0, 0x02, 0x18, 0x3A, 0x4E, 0x7C};

static byte Table3[] = {
0x73, 0x51, 0x95, 0xE1, 0x12, 0xE4, 0xC0, 0x58,
0xEE, 0xF2, 0x08, 0x1B, 0xA9, 0xFA, 0x98, 0x4C,
0xA7, 0x33, 0xE2, 0x1B, 0xA7, 0x6D, 0xF5, 0x30,
0x97, 0x1D, 0xF3, 0x02, 0x60, 0x5A, 0x82, 0x0F,
0x91, 0xD0, 0x9C, 0x10, 0x39, 0x7A, 0x83, 0x85,
0x3B, 0xB2, 0xB8, 0xAE, 0x0C, 0x09, 0x52, 0xEA,
0x1C, 0xE1, 0x8D, 0x66, 0x4F, 0xF3, 0xDA, 0x92,
0x29, 0xB9, 0xD5, 0xC5, 0x77, 0x47, 0x22, 0x53,
0x14, 0xF7, 0xAF, 0x22, 0x64, 0xDF, 0xC6, 0x72,
0x12, 0xF3, 0x75, 0xDA, 0xD7, 0xD7, 0xE5, 0x02,
0x9E, 0xED, 0xDA, 0xDB, 0x4C, 0x47, 0xCE, 0x91,
0x06, 0x06, 0x6D, 0x55, 0x8B, 0x19, 0xC9, 0xEF,
0x8C, 0x80, 0x1A, 0x0E, 0xEE, 0x4B, 0xAB, 0xF2,
0x08, 0x5C, 0xE9, 0x37, 0x26, 0x5E, 0x9A, 0x90,
0x00, 0xF3, 0x0D, 0xB2, 0xA6, 0xA3, 0xF7, 0x26,
0x17, 0x48, 0x88, 0xC9, 0x0E, 0x2C, 0xC9, 0x02,
0xE7, 0x18, 0x05, 0x4B, 0xF3, 0x39, 0xE1, 0x20,
0x02, 0x0D, 0x40, 0xC7, 0xCA, 0xB9, 0x48, 0x30,
0x57, 0x67, 0xCC, 0x06, 0xBF, 0xAC, 0x81, 0x08,
0x24, 0x7A, 0xD4, 0x8B, 0x19, 0x8E, 0xAC, 0xB4,
0x5A, 0x0F, 0x73, 0x13, 0xAC, 0x9E, 0xDA, 0xB6,
0xB8, 0x96, 0x5B, 0x60, 0x88, 0xE1, 0x81, 0x3F,
0x07, 0x86, 0x37, 0x2D, 0x79, 0x14, 0x52, 0xEA,
0x73, 0xDF, 0x3D, 0x09, 0xC8, 0x25, 0x48, 0xD8,
0x75, 0x60, 0x9A, 0x08, 0x27, 0x4A, 0x2C, 0xB9,
0xA8, 0x8B, 0x8A, 0x73, 0x62, 0x37, 0x16, 0x02,
0xBD, 0xC1, 0x0E, 0x56, 0x54, 0x3E, 0x14, 0x5F,
0x8C, 0x8F, 0x6E, 0x75, 0x1C, 0x07, 0x39, 0x7B,
0x4B, 0xDB, 0xD3, 0x4B, 0x1E, 0xC8, 0x7E, 0xFE,
0x3E, 0x72, 0x16, 0x83, 0x7D, 0xEE, 0xF5, 0xCA,
0xC5, 0x18, 0xF9, 0xD8, 0x68, 0xAB, 0x38, 0x85,
0xA8, 0xF0, 0xA1, 0x73, 0x9F, 0x5D, 0x19, 0x0B,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x33, 0x72, 0x39, 0x25, 0x67, 0x26, 0x6D, 0x71,
0x36, 0x77, 0x3C, 0x20, 0x62, 0x23, 0x68, 0x74,
0xC3, 0x82, 0xC9, 0x15, 0x57, 0x16, 0x5D, 0x81};

Sense of humour

[Ratface]

Who says that the authorities don't have a sense of humour. Surely, packaging the source code that is contested in a case into public court documents so they can be spread freely around the whole world is one of the funniest hacks going.

I nominate this for Slashdot's Greatest Hacks of the 21st Century competition that will probably show up in 999 years or so :-)

Thank you "SUPERIOR COURT OF THE STATE OF CALIFORNIA COUNTY OF SANTA CLARA "

You are ignorant of the facts.

[Anonymous Coward]

> Most of the kids I'm contacted by think DVD's should be played using dedicated appliances and
> hardware decoders only.

Think about it. This doesn't solve anything. First of all, there are very few true hardware DVD cards for computers. Most are really just hardware MPEG encoders, so the issue of CSS is just as relevant if you have a hardware card than if you don't. Secondly, we won't ever get specifications for these cards anyway, because the manufacturers signed agreements with Macrovision not to reveal anything to prevent the Macrovision from being turned off. (of course, people have already worked around this for all the cards anyway)

And most of all, we'll still be stuck with the obnoxious practice of region coding if we use somebody else's secret hardware system.

> The biggest argument is that deCSS was written to allow playback on Linux yet the defending
> lawyer emphatically denies the existance of any player for DVD files on Linux.

The defendents' lawyers argued that was WAS no DVD player for Linux before DeCSS. As a matter of fact, there now is one, and I am sure it will be publicly demonstrated at the trial.

> The public interest in this case has not been about playing DVD's on Linux but individual
> freedom. That makes the argument as credible as wanting to drink under the age of 21.

What, are you saying you shouldn't be allowed to buy DVDs and watch them until you're 21?

> So without any credibility behind the DVD argument, no DVD player,

The argument is that it is immoral for the MPAA or DVDCCA to tell us what we can or cannot do in our own homes, with the movies we paid them for. And see above, there is a DVD player for Linux. You know this because you've posted on the mailing list for it, so stop being facetious.

> we can only expect a repeat of the Fraunhoffer Gmbh fiasco.

This is where you are most wrong. Fraunhofer claimed to own the patent rights "essential" to the MP3 format. Moreover, no one could argue with them, because none of the people making free encoders bothered to really understand MPEG audio and know if the claim was valid or not. They were just copying the ISO source code and hacking it.

This is a case of legal reverse engineering, and CSS is not covered by any patent. And before you talk about the Xing license agreement, don't forget that U.S. courts have declared such licenses invalid in numerous cases already directly involving reverse engineering. (see the EFF web site for references) The MPAA is treading on thin legal justification for their actions.

And what makes you think we are going to lose? Have you looked at the press coverage recently? The headlines are "Linux DVD player denied", not "pirates arrested". There is strong public support for Johansen in Norway. The movie companies are going to end up tarnishing their imagine more than they ever could have possibly imagines.

Make Backups!

[Stiletto]

IANAL, but to the people who are listed in all of these lawsuits, make backups of everything you need and keep them in someplace secure, like a safe deposit box somewhere.

Even here in the good free USA, the government can and probably will barge into your homes, confiscate everything that looks technical, including your computers, CD's, discs, manuals, CD players, DVD players, etc. etc. They are under no obligation to return your stuff to you, even if you are eventually found not guilty!

Make sure you have backups of important stuff and possibly a computer you can use in the mean-time if they do raid you.

And if you do get raided, don't say a word to them without your attorney there. This should be obvious, but police and government agents can be very intimidating!

________________________________

Re:Make Backups!

[TheGratefulNet]

I don't see how they can take something of yours and be under no obligation to give it back.

your first mistake is to assume the US legal system ia a fair and just system, treating people with respect.

ha! yeah right - wake up and smell the coffee.

I've known folks who had their house raided and posessions stolen by the thugs^H^H^H^H^Hcops just because they were suspected of posessing drugs. yes, this country has a very screwed up sense of priorities. some ultra non-violent 'offender' gets royally fscked by the feds and permanently loses all rights to his posessions. has to face an incredibly expensive legal system - and still has ZERO recourse to regain his stolen (ie, stolen by the police) posessions. all for some right-wing moralistic scapegoat we call the 'war on drugs'.

but now, since they've come for the drug users and they're getting bored, they're now coming for the linux dvd viewing folks. what was that saying about "they came for the {mumble} and I wasn't a {mumble} so I didn't speak up. then they came for the {...} and I wasn't a {...} so I didn't speak up. then they came for me and there was no one left to speak up for me".

its getting chillier and chillier outside.

--

No More Games

[Effugas]

Let 'em reseal it. It's the *right* thing to do.

There is no reason to be craven about this. We don't need to argue that it might not have come from Xing, we don't need to argue that an accident in court suddenly invalidates a trade secret, we don't need to rely on cheap tricks to get our way.

It's called the Moral High Ground, folks.

Yes, the code is everywhere on the 'net. Stop for a moment and realize that this isn't a magic talisman. A horde of thieves is still composed of thieves, and that's all we're saying by saying we've all got it and you can't stop us.

But guess what, folks. We ain't thieves. Lets not fall into their trap.

(Yes, this post is conspicuously absent of my defense of DeCSS, mainly because I want to finish my main paper on the topic and release all at once. Email me if you believe in the spirit of the law, because believe me, in the end it's going to be the spirit more than the letter that will carry the day.)

Yours Truly,

Dan Kaminsky
DoxPara Research
http://www.doxpara.com

Buy the T-Shirt!!!

[Megaweapon]

Everyone go to Copyleft.net and buy a DVD t-shirt with css_descramble.c source code on the back!

Why we're going to lose just like we lost mp3

[heroine]

Most of the kids I'm contacted by think DVD's should be played using dedicated appliances and hardware decoders only. CmdrTaco uses a DVD appliance. VALinux uses WinNT.

The biggest argument is that deCSS was written to allow playback
on Linux yet the defending lawyer emphatically denies the existance of any player for DVD files on Linux.

The public interest in this case has not been about playing DVD's on Linux but individual freedom. That makes the argument as credible as wanting to drink under the age of 21. Face it. When you're a teenager you have no rights, but when you graduate from college you'll inevitably have more rights. How many Linux hackers do you run into who have graduated from college? So without any credibility behind the DVD argument, no DVD player, and no interest we can only expect a repeat of the Fraunhoffer Gmbh fiasco.

Too fast -- too slow -- just right?

[werdna]

The legal system is an administrative nightmare in many respects, and can never move with adequate speed, except when things are moving at a breakneck rate. As a practicing lawyer, I can say that the vast majority of practice is to diligently work following the Boy Scout Motto, so that when the SHTF, you can flurry out a vast amount of work product, appearing to have been superhumanly quick.

To a layperson, the law seems to move glacially (and it generally does). Nothing ever gets decided, and when it does, only a little bit at a time.

There are some exceptions, however, and good agressive lawyers can use them to achieve partial results with remarkable speed. One is the preliminary inunction/TRO -- which by rule must be decided promptly. The other are these administrative emergency motions. The court is highly likely to seal this initially, and promptly, on the theory that it can always be unsealed, but that if not sealed, the toothpaste cannot be put back in the tube. (cat-out-of-bag, genie-bottle, pick the cliche of your choosing).

It certainly *DOES* seem unfair when you represent defendants (as we seem to be doing a lot of these days), and a plaintiff who has had months to prepare a complaint and preliminary injunction/TRO papers just files, serves, and gives you just days to rally (usually just hours, since the client has spent days shopping for a lawyer). In practice, though, this is often enough time to address the status quo questions.

I cannot defend the conduct of MPAA, but I note that the results obtained so far, and the tactics used, are not unusual or surprising. Such tactics are regularly used by plaintiffs representing not only corporate monsters but also individuals. (I presently have a case where an individual unwealthy single mom who sued a corporation for copyright infringement. Her lawyers used precisely the same tactics.)

In other words, cool your jets. This is not the unconcionable part -- it is in fact routine and expected legal stuff. The unconcionable part comes on the bringing of the case and the results on the merits.

In just a few weeks, the opportunities for breakneck nasties are over, and we will be communally criticizing the system for being so onerously slow at being able to finally resolve these questions.

I know its not as much fun as presuming that the judges are cowtowing to wealthy powers-that-be in whose pockets they reside, giving opportunities to the monied not available to mere mortals. But this just isn't the case as to *THIS MOTION* -- it is a fairly routine matter, and one that doesn't require much effort for which to prepare a response.

Clueless!

[tilleyrw]

The MPA (Motion Picture Association) is an American organization that
has trouble with the fact that the DVD "code" mechanism has been broken.
They still don't realize some facts of life.

When recordable cassette decks became common, they were feared as a
means of breaking the back of the music industry -- one person would
buy an album, and then distribute copies.

This happened with videotapes.

With CDs.

Will happen with DVDs.
(Just buy a Phillips DVD recorder and make bit-wise copies of a DVD for an
exact copy.)

The majority of people (the market) will still buy original copies.
This is not a theory or hypothesis but a simple truth. It is easier
for a person to go to the local MediaShop to buy a movie, or music, or
anything else than to find Joe "Jon Johansen" Hacker to burn them a copy
of Titanic.

Sure some people copy their work and distribute the copies. There is always
going to be a "grey" (I think chartreuse, but that's me) area surrounding
the profit zone. Grow up and live with it.

Focus on the profitable area and be satisfied with it.

Legality of DeCSS

[jd]

My 2 cents worth:

1. CSS is an interface between the DVD and the display. Interfaces are NOT patentable OR copyrightable, either in the US or EU.
2. Encryption is not significantly different from simply using another language. Translation is, again, completely protected by law.
3. DeCSS has no write capability. It's read-only. So what if it could be -modified- to be read-write. You could modify a cookie, with a dash of liquid oxygen, to being a highly explosive device. Does that mean cookies should be classed as munitions? Potential is not enough.
4. The companies are getting away with this, because Rich Companies have more power than small Governments. Whilst I'm not going to accuse anyone of corruption (including the police in Norway), who exactly is dictating the law, in this case?
5. The case is about copyright, in Norway, yet no equiptment exists for copying entire DVDs, and the disks & writers that -do- exist are so expensive, you could buy the originals and have money left over for a 5-course sushi banquet.
6. The Copyright Office has not yet decided what the terms of the Digital Millenium Act -ARE-! The judge is being pressured into reaching a verdict and passing sentance quickly, IMHO, because they have to do so -before- the Government can decide what the law means. It's the only way to be sure of securing a conviction AND a media coup, and even if the law is "clarified" to legalise DeCSS, afterwards, nobody'll dare, in face of the threat, and the sentances already passed are unlikely to be revoked & the people pardoned, in retrospect. The industry wants blood, and it wants it before they're forced to be vegitarian.

This case is realy against RedHat and Diamond

[Forge]

It's called prosecution by proxy.

I have said it before and I will say it again. This hasn't got squat to do with weather you or I have LiViD. It's actually about making sure Diamond Multimedia can't use it. It's so RedHot and Mandrake can't distribute it to the next generation of Linux users.

What's the deference between us and them ? They have money, wide distribution channels, deep pockets and the will to sell DVD players ( software and hardware ) for less than they cost now.

The aim of this lawsuit is to get a court to rule that DeCSS is outlawed. This is why http://www.2600.com was one of the defendants in each and every case. They have been protesting about Kevin M. for like 5 years. They have a bad rep to judges and the like ( "how dare you say he is being held unjustly" ).

Once such a ruling exists DeCSS and LiViD will remain things a technically savvy user downloads and installs on his own to play DVDs. Without the ruling it becomes something smaller electronics companies use to avoid forking over a few bucks for ever DVD player they ship. The big companies ( Sony ) will follow suite and the DVD-CCA will seas to exist.

So the fact is distributing it far and wide doesn't mean squat. What we need now is to win in court. We need to make a *Judge* say that these people are talking out of there asses and the stuff was revers engineered fair and square.

This is also why they went after that kid so brutally. They don't so much want him to stop distributing it since he did that months ago when they asked the 1st time. They want to pressure him into signing an Affidavit to the effect that "I stole this data illegally and apologize for letting it get out."

That last point explains why his father was also taken. It's all an attempt to scare his mother into making him "confess". Some of the Linux hackers in Norway need to be at that family's house today. Comfort them, tell them you care and most importantly be prepared to fight for them as much as possible. That way you keep the kid in the fight and we can't afford to have him quit. Ever.

BTW : Somebody loan him a new PC for me.

Re: a new contest is open... + a huge concern

[CodeShark]

You blew the URL, buddy, even though there's a reminder right under the box. (you forgot the http:// in the HREF). So I'll fix it for you, and then ask my question. The contest is called the Obfuscated DeCSS contest, and what the site author seems to be starting with is a request for us to send ideas for a good set of ground rules, then kick off the contest around the middle of February.

In a different vein, I have what I think is an important question related to the public documentation part 'though: If we downloaded the "exhibit a", part of the document while it was "open" (which is the DeCSS source in question), and then they seal it, what is the legal status of those copies we downloaded?

The closest analogy I can think of is this: if I went to the courthouse and made xerox copies of a public document which was later "sealed" by the court, would I somehow be in violation of the law? If so, it seems like it would be an "ex post facto" law (a law passed making a crime out of an act which had not previously been legislated against). At least in the US of A, "ex post facto" prosecution is against our constitutional rights. IANAL and this has me very very concerned.

What disturbs me is..

[Justin Wake]

.. this little piece:

23. Gilmore goes on to state that "[o]ne major reason [for making such copies] is to allow Linux developers and users to watch their DVDs on their non-Windows computers." (Id. at 10). Linux is an alternative operating system to Windows. It was developed as an "open" system which is available at no charge to the user. To date, no person or entity has taken a license from DVD CCA or its predecessor to use CSS in a Linux application. If a person or entity were prepared to take a license on the same terms as existing licensees, such a license would be granted. At that point, Linux users could lawfully view motion pictures on their non-Windows operating system. Until then, Linux users have no "right," via a "hack" around other software licenses, like the Xing license, to gain access to this proprietary technology. (my emphasis)

Could someone please point out to me where it states on my DVD discs (or associated containers/sleeves/whatnot) that I have "no right" to view them on my Linux system?

Looking at the back of my "Blade" case I can see the following warning:
WARNING: This digital video disc is sold on the condition it is not offered for sale or hire outside Australia (Fine with me.. I'm Australian and live there)
The copyright proprietor has licensed the film (including the soundtrack) comprised in this digital video disc for home use only (Fine also, my computer is indeed in my home) All other rights are reserved. Any unauthorised copying, editing, exhibition, renting, exchanging, hiring, lending, public performances and/or broadcasts of this digital video disc or any part thereof is strictly prohibited.

Did you see any mention of Linux there? Me neither.
In my opinion, it is becoming more and more obvious that this case is not about DeCSS; it is about the DVD CCA's right to charge exorbitant amounts of money for their beloved "licenses", along with imposing restrictions on said licenses that would be prohibitive of Linux development (which would most likely be under the GPL).

Just think of what could happen if we win this case. Suddenly, all the developers who have agreed to licenses for using CSS code can bypass those licenses and save some dough in the process. A new breed of players could crop up, designed by people/groups who have the programming ability but not the cash to afford a license. All of this would lead to one thing: reduced income for the CCA. Indeed, is CSS not the CCA's main asset (if not the only one)? If so, then the CCA could stand to lose their entire reason to exist if this case fails..

In any case, I think it is appalling that the CCA can openly suggest that Linux users have no "right" to view movies that they have legally purchased. Isn't this called product tying? I hope they get what they deserve.. a solid beating :)

As a side note, does this mean they will be adding the court to their list of defendants, thus effectively suing the entire United States of America? Maybe the US Govt. will be able to put up some cash towards the war effort :p

Disclaimer: I'm not a lawyer. (how typical) I'm posting this from Australia (of course), so I apologise in advance if the records are resealed before this was posted - I'm not entirely sure what the time is in the US :)