* dvd_css.c: Functions for DVD authentification and unscrambling
*****************************************************************************
* Copyright (C) 1999-2001 VideoLAN
- * $Id: dvd_css.c,v 1.5 2001/02/09 18:34:01 stef Exp $
+ * $Id: dvd_css.c,v 1.12 2001/02/20 07:49:12 sam Exp $
*
* Author: Stéphane Borel <stef@via.ecp.fr>
*
+ * based on:
+ * - css-auth by Derek Fawcus <derek@spider.com>
+ * - DVD CSS ioctls example program by Andrew T. Veliath <andrewtv@usa.net>
+ * - The Divide and conquer attack by Frank A. Stevenson<frank@funcom.com>
+ * - DeCSSPlus by Ethan Hawke
+ * - DecVOB
+ * see http://www.lemuria.org/DeCSS/ by Tom Vogt for more information.
+ *
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
*****************************************************************************/
#include "defs.h"
-#if defined( HAVE_SYS_DVDIO_H ) || defined( LINUX_DVD )
+#if defined( HAVE_SYS_DVDIO_H ) || defined( LINUX_DVD ) || defined( SYS_BEOS )
#include <stdio.h>
#include <unistd.h>
# include <linux/cdrom.h>
#endif
-
#include "common.h"
#include "intf_msg.h"
+
#include "dvd_css.h"
+#include "dvd_ioctl.h"
#include "dvd_ifo.h"
+
#include "input_dvd.h"
-#include "css_table.h"
/*****************************************************************************
* CSS tables
*****************************************************************************/
-
-unsigned int pi_css_tab0[11]={ 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4 };
-
-unsigned char pi_css_tab1[256]=
+static u8 pi_css_tab1[256]=
{ 0x33, 0x73, 0x3b, 0x26, 0x63, 0x23, 0x6b, 0x76,
0x3e, 0x7e, 0x36, 0x2b, 0x6e, 0x2e, 0x66, 0x7b,
0xd3, 0x93, 0xdb, 0x06, 0x43, 0x03, 0x4b, 0x96,
0x39, 0x79, 0x31, 0x20, 0x69, 0x29, 0x61, 0x70,
0x38, 0x78, 0x30, 0x21, 0x68, 0x28, 0x60, 0x71,
0xb7, 0xf7, 0xbf, 0xa2, 0xe7, 0xa7, 0xef, 0xf2,
- 0xba, 0xfa, 0xb2, 0xaf, 0xea, 0xaa, 0xe2, 0xff };
+ 0xba, 0xfa, 0xb2, 0xaf, 0xea, 0xaa, 0xe2, 0xff
+};
-unsigned char pi_css_tab2[256]=
+static u8 pi_css_tab2[256]=
{ 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
0x09, 0x08, 0x0b, 0x0a, 0x0d, 0x0c, 0x0f, 0x0e,
0x12, 0x13, 0x10, 0x11, 0x16, 0x17, 0x14, 0x15,
0xe4, 0xe5, 0xe6, 0xe7, 0xe0, 0xe1, 0xe2, 0xe3
};
-unsigned char pi_css_tab3[512]=
+static u8 pi_css_tab3[512]=
{ 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
- 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
- 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
- 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
- 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
- 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff };
+ 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
+ 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
+ 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
+ 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff,
+ 0x00, 0x24, 0x49, 0x6d, 0x92, 0xb6, 0xdb, 0xff
+};
-unsigned char pi_css_tab4[256]=
+static u8 pi_css_tab4[256]=
{ 0x00, 0x80, 0x40, 0xc0, 0x20, 0xa0, 0x60, 0xe0,
0x10, 0x90, 0x50, 0xd0, 0x30, 0xb0, 0x70, 0xf0,
0x08, 0x88, 0x48, 0xc8, 0x28, 0xa8, 0x68, 0xe8,
0x07, 0x87, 0x47, 0xc7, 0x27, 0xa7, 0x67, 0xe7,
0x17, 0x97, 0x57, 0xd7, 0x37, 0xb7, 0x77, 0xf7,
0x0f, 0x8f, 0x4f, 0xcf, 0x2f, 0xaf, 0x6f, 0xef,
- 0x1f, 0x9f, 0x5f, 0xdf, 0x3f, 0xbf, 0x7f, 0xff };
+ 0x1f, 0x9f, 0x5f, 0xdf, 0x3f, 0xbf, 0x7f, 0xff
+};
-unsigned char pi_css_tab5[256]=
+static u8 pi_css_tab5[256]=
{ 0xff, 0x7f, 0xbf, 0x3f, 0xdf, 0x5f, 0x9f, 0x1f,
0xef, 0x6f, 0xaf, 0x2f, 0xcf, 0x4f, 0x8f, 0x0f,
0xf7, 0x77, 0xb7, 0x37, 0xd7, 0x57, 0x97, 0x17,
0xf8, 0x78, 0xb8, 0x38, 0xd8, 0x58, 0x98, 0x18,
0xe8, 0x68, 0xa8, 0x28, 0xc8, 0x48, 0x88, 0x08,
0xf0, 0x70, 0xb0, 0x30, 0xd0, 0x50, 0x90, 0x10,
- 0xe0, 0x60, 0xa0, 0x20, 0xc0, 0x40, 0x80, 0x00 };
+ 0xe0, 0x60, 0xa0, 0x20, 0xc0, 0x40, 0x80, 0x00
+};
+static u8 pi_crypt_tab0[256] = {
+ 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 u8 pi_crypt_tab1[256] = {
+ 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 u8 pi_crypt_tab2[256] = {
+ 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 u8 pi_crypt_tab3[288] = {
+ 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};
/*
* Local functions
*/
/*****************************************************************************
* CSSGetASF : Get Authentification success flag
+ * ---
+ * Returns :
+ * -1 on ioctl error,
+ * 0 if the device needs to be authenticated,
+ * 1 either.
*****************************************************************************/
static int CSSGetASF( int i_fd )
{
- dvd_authinfo ai;
+ dvd_authinfo auth_info;
- ai.type = DVD_LU_SEND_ASF;
- ai.lsasf.asf = 0;
+ auth_info.type = DVD_LU_SEND_ASF;
+ auth_info.lsasf.asf = 0;
- for( ai.lsasf.agid = 0 ; ai.lsasf.agid < 4 ; ai.lsasf.agid++ )
+ for( auth_info.lsasf.agid = 0 ; auth_info.lsasf.agid < 4 ;
+ auth_info.lsasf.agid++ )
{
- if( !( ioctl( i_fd, DVD_AUTH, &ai ) ) )
+ if( !( dvd_ioctl( i_fd, DVD_AUTH, &auth_info ) ) )
{
- intf_Msg("CSS: %sAuthenticated\n", (ai.lsasf.asf) ? "" : "not");
- return 0;
+ intf_WarnMsg( 3, "CSS: %sAuthenticated",
+ ( auth_info.lsasf.asf ) ? "" : "not " );
+ return auth_info.lsasf.asf;
}
}
- intf_ErrMsg( "CSS Error: GetASF" );
+
+ /* The ioctl process has failed */
+ intf_ErrMsg( "CSS: GetASF Fatal Error" );
return -1;
}
/*****************************************************************************
* CSSCryptKey : shuffles bits and unencrypt keys.
+ * Used during authentication and disc key negociation in CSSInit.
* ---
* i_key_type : 0->key1, 1->key2, 2->buskey.
* i_varient : between 0 and 31.
u8 const * pi_challenge, u8* pi_key )
{
/* Permutation table for challenge */
- u8 ppi_perm_challenge[3][10] =
+ u8 ppi_perm_challenge[3][10] =
{ { 1, 3, 0, 7, 5, 2, 9, 6, 4, 8 },
{ 6, 1, 9, 3, 8, 5, 7, 4, 0, 2 },
{ 4, 0, 3, 5, 7, 2, 8, 6, 1, 9 } };
- /* Permutation table for varient table */
+
+ /* Permutation table for varient table for key2 and buskey */
u8 ppi_perm_varient[2][32] =
{ { 0x0a, 0x08, 0x0e, 0x0c, 0x0b, 0x09, 0x0f, 0x0d,
0x1a, 0x18, 0x1e, 0x1c, 0x1b, 0x19, 0x1f, 0x1d,
0x10, 0x18, 0x14, 0x1c, 0x00, 0x08, 0x04, 0x0c,
0x13, 0x1b, 0x17, 0x1f, 0x03, 0x0b, 0x07, 0x0f,
0x11, 0x19, 0x15, 0x1d, 0x01, 0x09, 0x05, 0x0d } };
- u8 pi_css_secret[5] = { 0xE2, 0xA3, 0x45, 0x10, 0xF4 };
- u8 pi_css_varients[32] =
- { 0x00, 0x01, 0x04, 0x05, 0x10, 0x11, 0x14, 0x15,
- 0x20, 0x21, 0x24, 0x25, 0x30, 0x31, 0x34, 0x35,
- 0x80, 0x81, 0x84, 0x85, 0x90, 0x91, 0x94, 0x95,
- 0xA0, 0xA1, 0xA4, 0xA5, 0xB0, 0xB1, 0xB4, 0xB5 };
+
+ u8 pi_varients[32] =
+ { 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 };
+
+ /* The "secret" key */
+ u8 pi_secret[5] = { 0x55, 0xD6, 0xC4, 0xC5, 0x28 };
+
u8 pi_bits[30];
u8 pi_scratch[10];
u8 pi_tmp1[5];
u8 pi_tmp2[5];
- u8 i_lfsr0_o;
- u8 i_lfsr1_o;
+ u8 i_lfsr0_o; /* 1 bit used */
+ u8 i_lfsr1_o; /* 1 bit used */
u32 i_lfsr0;
u32 i_lfsr1;
u8 i_css_varient;
- int i_val = 0;
+ u8 i_cse;
+ u8 i_index;
+ u8 i_combined;
+ u8 i_carry;
+ u8 i_val = 0;
int i_term = 0;
- int i, i_index;
+ int i_bit;
+ int i;
- for( i=0 ; i<10 ; i++ )
- {
+ for (i = 9; i >= 0; --i)
pi_scratch[i] = pi_challenge[ppi_perm_challenge[i_key_type][i]];
- }
- i_css_varient = i_key_type == 0 ? i_varient
- : ppi_perm_varient[i_key_type-1][i_varient];
- for( i=0 ; i<5 ; i++ )
+ i_css_varient = ( i_key_type == 0 ) ? i_varient :
+ ppi_perm_varient[i_key_type-1][i_varient];
+
+ /*
+ * 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.
+ */
+
+ /* 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 ; )
{
- pi_tmp1[i] = pi_scratch[5+i] ^ pi_css_secret[i];
+ pi_tmp1[i] = pi_scratch[5 + i] ^ pi_secret[i] ^ pi_crypt_tab2[i];
}
+ /*
+ * 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.
+ *
+ */
+
/* 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.
*/
i_lfsr0 = ( pi_tmp1[0] << 17 ) | ( pi_tmp1[1] << 9 ) |
- ( ( pi_tmp1[2] & ~7 ) << 1 ) | 8 | (pi_tmp1[2] & 7);
-
- /*
- * reverse lfsr0/1 to simplify calculation in loop
- */
- i_lfsr0 = ( pi_reverse[i_lfsr0 & 0xff] << 17 ) |
- ( pi_reverse[( i_lfsr0 >> 8 ) & 0xff] << 9 ) |
- ( pi_reverse[( i_lfsr0 >> 16 ) & 0xff] << 1) |
- ( i_lfsr0 >> 24 );
+ (( pi_tmp1[2] & ~7 ) << 1 ) | 8 | ( pi_tmp1[2] & 7 );
+ i_lfsr1 = ( pi_tmp1[3] << 9 ) | 0x100 | pi_tmp1[4];
- i_lfsr1 = ( pi_reverse[pi_tmp1[4]] << 9 ) | 0x100 |
- ( pi_reverse[pi_tmp1[3]] );
+ i_index = sizeof(pi_bits);
+ i_carry = 0;
- i_index = sizeof( pi_bits );
do
{
- i_lfsr0_o = ( i_lfsr0 >> 12) ^ ( i_lfsr0 >> 4) ^
- ( i_lfsr0 >> 3) ^ i_lfsr0;
+ for( i_bit = 0, i_val = 0 ; i_bit < 8 ; ++i_bit )
+ {
- i_lfsr1_o = ( ( i_lfsr1 >> 14 ) & 7) ^ i_lfsr1;
- i_lfsr1_o ^= ( i_lfsr1_o << 3 ) ^ ( i_lfsr1_o << 6 );
+ i_lfsr0_o = ( ( i_lfsr0 >> 24 ) ^ ( i_lfsr0 >> 21 ) ^
+ ( i_lfsr0 >> 20 ) ^ ( i_lfsr0 >> 12 ) ) & 1;
+ i_lfsr0 = ( i_lfsr0 << 1 ) | i_lfsr0_o;
- i_lfsr1 = ( i_lfsr1 >> 8) ^ ( i_lfsr1_o << 9);
- i_lfsr0 = ( i_lfsr0 >> 8 ) ^ ( i_lfsr0_o << 17);
+ i_lfsr1_o = ( ( i_lfsr1 >> 16 ) ^ ( i_lfsr1 >> 2 ) ) & 1;
+ i_lfsr1 = ( i_lfsr1 << 1 ) | i_lfsr1_o;
- i_lfsr0_o = ~i_lfsr0_o;
- i_lfsr1_o = ~i_lfsr1_o;
+#define BIT0(x) ((x) & 1)
+#define BIT1(x) (((x) >> 1) & 1)
- i_val += i_lfsr0_o + i_lfsr1_o;
+ i_combined = !i_lfsr1_o + i_carry + !i_lfsr0_o;
+ /* taking bit 1 */
+ i_carry = ( i_combined >> 1 ) & 1;
+ i_val |= ( i_combined & 1 ) << i_bit;
+ }
- pi_bits[--i_index] = i_val & 0xFF;
- i_val >>= 8;
-
+ pi_bits[--i_index] = i_val;
} while( i_index > 0 );
- i_css_varient = pi_css_varients[i_css_varient];
-
- intf_WarnMsg( 3, "CSS varient: %d\n", i_css_varient );
+ /* This term is used throughout the following to
+ * select one of 32 different variations on the
+ * algorithm.
+ */
+ i_cse = pi_varients[i_css_varient] ^ pi_crypt_tab2[i_css_varient];
- /*
- * Mangling
+ /* Now the actual blocks doing the encryption. Each
+ * of these works on 40 bits at a time and are quite
+ * similar.
*/
+ i_index = 0;
for( i = 5, i_term = 0 ; --i >= 0 ; i_term = pi_scratch[i] )
{
- i_index = pi_bits[25+i] ^ pi_scratch[i];
- i_index = pi_css_mangle1[i_index] ^ i_css_varient;
- pi_tmp1[i] = pi_css_mangle2[i_index] ^ i_term;
+ i_index = pi_bits[25 + i] ^ pi_scratch[i];
+ i_index = pi_crypt_tab1[i_index] ^ ~pi_crypt_tab2[i_index] ^ i_cse;
+
+ pi_tmp1[i] = pi_crypt_tab2[i_index] ^ pi_crypt_tab3[i_index] ^ i_term;
}
pi_tmp1[4] ^= pi_tmp1[0];
+
for( i = 5, i_term = 0 ; --i >= 0 ; i_term = pi_tmp1[i] )
{
- i_index = pi_bits[20+i] ^ pi_tmp1[i];
- i_index = pi_css_mangle1[i_index] ^ i_css_varient;
- pi_tmp2[i] = pi_css_mangle2[i_index] ^ i_term;
+ i_index = pi_bits[20 + i] ^ pi_tmp1[i];
+ i_index = pi_crypt_tab1[i_index] ^ ~pi_crypt_tab2[i_index] ^ i_cse;
+
+ pi_tmp2[i] = pi_crypt_tab2[i_index] ^ pi_crypt_tab3[i_index] ^ i_term;
}
pi_tmp2[4] ^= pi_tmp2[0];
+
for( i = 5, i_term = 0 ; --i >= 0 ; i_term = pi_tmp2[i] )
{
- i_index = pi_bits[15+i] ^ pi_tmp2[i];
- i_index = pi_css_mangle1[i_index] ^ i_css_varient;
- i_index = pi_css_mangle2[i_index] ^ i_term;
- pi_tmp1[i] = pi_css_mangle0[i_index];
+ i_index = pi_bits[15 + i] ^ pi_tmp2[i];
+ i_index = pi_crypt_tab1[i_index] ^ ~pi_crypt_tab2[i_index] ^ i_cse;
+ i_index = pi_crypt_tab2[i_index] ^ pi_crypt_tab3[i_index] ^ i_term;
+
+ pi_tmp1[i] = pi_crypt_tab0[i_index] ^ pi_crypt_tab2[i_index];
}
pi_tmp1[4] ^= pi_tmp1[0];
+
for( i = 5, i_term = 0 ; --i >= 0 ; i_term = pi_tmp1[i] )
{
- i_index = pi_bits[10+i] ^ pi_tmp1[i];
- i_index = pi_css_mangle1[i_index] ^ i_css_varient;
- i_index = pi_css_mangle2[i_index] ^ i_term;
- pi_tmp2[i] = pi_css_mangle0[i_index];
+ i_index = pi_bits[10 + i] ^ pi_tmp1[i];
+ i_index = pi_crypt_tab1[i_index] ^ ~pi_crypt_tab2[i_index] ^ i_cse;
+
+ i_index = pi_crypt_tab2[i_index] ^ pi_crypt_tab3[i_index] ^ i_term;
+
+ pi_tmp2[i] = pi_crypt_tab0[i_index] ^ pi_crypt_tab2[i_index];
}
pi_tmp2[4] ^= pi_tmp2[0];
+
for( i = 5, i_term = 0 ; --i >= 0 ; i_term = pi_tmp2[i] )
{
- i_index = pi_bits[5+i] ^ pi_tmp2[i];
- i_index = pi_css_mangle1[i_index] ^ i_css_varient;
- pi_tmp1[i] = pi_css_mangle2[i_index] ^ i_term;
+ i_index = pi_bits[5 + i] ^ pi_tmp2[i];
+ i_index = pi_crypt_tab1[i_index] ^ ~pi_crypt_tab2[i_index] ^ i_cse;
+
+ pi_tmp1[i] = pi_crypt_tab2[i_index] ^ pi_crypt_tab3[i_index] ^ i_term;
}
pi_tmp1[4] ^= pi_tmp1[0];
- for( i=5, i_term=0 ; --i>=0 ; i_term=pi_tmp1[i] )
+ for(i = 5, i_term = 0 ; --i >= 0 ; i_term = pi_tmp1[i] )
{
i_index = pi_bits[i] ^ pi_tmp1[i];
- i_index = pi_css_mangle1[i_index] ^ i_css_varient;
- pi_key[i] = pi_css_mangle2[i_index] ^ i_term;
- }
-
- return;
-}
-
-static int CSSAuthHost( dvd_authinfo *ai, disc_t *disc )
-{
- int i;
-
- switch( ai->type )
- {
- /* Host data receive (host changes state) */
- case DVD_LU_SEND_AGID:
-
- ai->type = DVD_HOST_SEND_CHALLENGE;
- break;
-
- case DVD_LU_SEND_KEY1:
-
- for( i=0; i<KEY_SIZE; i++ )
- {
- disc->pi_key1[i] = ai->lsk.key[4-i];
- }
-
- for( i=0; i<32; ++i )
- {
- CSSCryptKey( 0, i, disc->pi_challenge,
- disc->pi_key_check );
+ i_index = pi_crypt_tab1[i_index] ^ ~pi_crypt_tab2[i_index] ^ i_cse;
- if( memcmp( disc->pi_key_check,
- disc->pi_key1, KEY_SIZE ) == 0 )
- {
- intf_WarnMsg( 3, "CSS: Drive Authentic - using varient %d\n", i);
- disc->i_varient = i;
- ai->type = DVD_LU_SEND_CHALLENGE;
- break;
- }
- }
-// intf_ErrMsg( "Drive would not Authenticate" );
-// ai->type = DVD_AUTH_FAILURE;
-// return -22;
- break;
-
- case DVD_LU_SEND_CHALLENGE:
- for( i=0; i<10; ++i )
- {
- disc->pi_challenge[i] = ai->hsc.chal[9-i];
- }
- CSSCryptKey( 1, disc->i_varient, disc->pi_challenge,
- disc->pi_key2 );
- ai->type = DVD_HOST_SEND_KEY2;
- break;
-
- /* Host data send */
- case DVD_HOST_SEND_CHALLENGE:
- for( i=0; i<10; ++i )
- {
- ai->hsc.chal[9-i] = disc->pi_challenge[i];
- }
- /* Returning data, let LU change state */
- break;
-
- case DVD_HOST_SEND_KEY2:
- for( i=0; i<KEY_SIZE; ++i )
- {
- ai->hsk.key[4-i] = disc->pi_key2[i];
- }
- /* Returning data, let LU change state */
- break;
-
- default:
- intf_ErrMsg( "CSS: Got invalid state %d", ai->type );
- return -22;
+ pi_key[i] = pi_crypt_tab2[i_index] ^ pi_crypt_tab3[i_index] ^ i_term;
}
- return 0;
+ return;
}
/*****************************************************************************
* CSSCracker : title key decryption by cracking
+ * ---
+ * This function is called by CSSGetKeys to find a key
*****************************************************************************/
-
-// FIXME : adapt to vlc
-#define KEYSTREAMBYTES 10
-
-static unsigned char invtab4[256];
-
-static int CSScracker( int StartVal,
- unsigned char* pCrypted,
- unsigned char* pDecrypted,
- DVD_key_t *StreamKey,
- DVD_key_t *pkey )
+static int CSSCracker( int i_start,
+ unsigned char * p_crypted,
+ unsigned char * p_decrypted,
+ dvd_key_t * p_sector_key,
+ dvd_key_t * p_key )
{
- unsigned char MyBuf[10];
- unsigned int t1,t2,t3,t4,t5,t6;
- unsigned int nTry;
- unsigned int vCandidate;
- int i;
- unsigned int j;
+ unsigned char pi_buffer[10];
+ unsigned int i_t1, i_t2, i_t3, i_t4, i_t5, i_t6;
+ unsigned int i_try;
+ unsigned int i_candidate;
+ unsigned int i, j;
int i_exit = -1;
- for (i=0;i<10;i++)
- {
- MyBuf[i] = pi_css_tab1[pCrypted[i]] ^ pDecrypted[i];
- }
-
- /* Test that CSStab4 is a permutation */
- memset( invtab4, 0, 256 );
- for( i = 0 ; i < 256 ; i++ )
- {
- invtab4[ pi_css_tab4[i] ] = 1;
- }
-
- for (i = 0 ; i < 256 ; i++)
- {
- if (invtab4[ i ] != 1)
- {
- intf_ErrMsg( "CSS: Permutation error" );
- exit( -1 );
- }
- }
-
- /* initialize the inverse of table4 */
- for( i = 0 ; i < 256 ; i++ )
+ for( i = 0 ; i < 10 ; i++ )
{
- invtab4[ pi_css_tab4[i] ] = i;
+ pi_buffer[i] = pi_css_tab1[p_crypted[i]] ^ p_decrypted[i];
}
- for( nTry = StartVal ; nTry < 65536 ; nTry++ )
+ for( i_try = i_start ; i_try < 0x10000 ; i_try++ )
{
- t1 = nTry >> 8 | 0x100;
- t2 = nTry & 0xff;
- t3 = 0; /* not needed */
- t5 = 0;
+ i_t1 = i_try >> 8 | 0x100;
+ i_t2 = i_try & 0xff;
+ i_t3 = 0; /* not needed */
+ i_t5 = 0;
/* iterate cipher 4 times to reconstruct LFSR2 */
for( i = 0 ; i < 4 ; i++ )
{
/* advance LFSR1 normaly */
- t4=pi_css_tab2[t2]^pi_css_tab3[t1];
- t2=t1>>1;
- t1=((t1&1)<<8)^t4;
- t4=pi_css_tab5[t4];
- /* deduce t6 & t5 */
- t6 = MyBuf[ i ];
- if( t5 )
+ i_t4 = pi_css_tab2[i_t2] ^ pi_css_tab3[i_t1];
+ i_t2 = i_t1 >> 1;
+ i_t1 = ( ( i_t1 & 1 ) << 8 ) ^ i_t4;
+ i_t4 = pi_css_tab5[i_t4];
+ /* deduce i_t6 & i_t5 */
+ i_t6 = pi_buffer[i];
+ if( i_t5 )
{
- t6 = ( t6 + 0xff )&0x0ff;
+ i_t6 = ( i_t6 + 0xff ) & 0x0ff;
}
- if( t6 < t4 )
+ if( i_t6 < i_t4 )
{
- t6 += 0x100;
+ i_t6 += 0x100;
}
- t6 -= t4;
- t5 += t6 + t4;
- t6 = invtab4[ t6 ];
- /* feed / advance t3 / t5 */
- t3 = (t3 << 8) | t6;
- t5 >>= 8;
+ i_t6 -= i_t4;
+ i_t5 += i_t6 + i_t4;
+ i_t6 = pi_css_tab4[ i_t6 ];
+ /* feed / advance i_t3 / i_t5 */
+ i_t3 = ( i_t3 << 8 ) | i_t6;
+ i_t5 >>= 8;
}
- vCandidate = t3;
+ i_candidate = i_t3;
/* iterate 6 more times to validate candidate key */
- for( ; i < KEYSTREAMBYTES ; i++ )
+ for( ; i < 10 ; i++ )
{
- t4=pi_css_tab2[t2]^pi_css_tab3[t1];
- t2=t1>>1;
- t1=((t1&1)<<8)^t4;
- t4=pi_css_tab5[t4];
- t6=(((((((t3>>3)^t3)>>1)^t3)>>8)^t3)>>5)&0xff;
- t3=(t3<<8)|t6;
- t6=pi_css_tab4[t6];
- t5+=t6+t4;
- if( (t5 & 0xff) != MyBuf[i] ) break;
- t5>>=8;
+ i_t4 = pi_css_tab2[i_t2] ^ pi_css_tab3[i_t1];
+ i_t2 = i_t1 >> 1;
+ i_t1 = ( ( i_t1 & 1 ) << 8 ) ^ i_t4;
+ i_t4 = pi_css_tab5[i_t4];
+ i_t6 = ((((((( i_t3 >> 3 ) ^ i_t3 ) >> 1 ) ^
+ i_t3 ) >> 8 ) ^ i_t3 ) >> 5 ) & 0xff;
+ i_t3 = ( i_t3 << 8 ) | i_t6;
+ i_t6 = pi_css_tab4[i_t6];
+ i_t5 += i_t6 + i_t4;
+ if( ( i_t5 & 0xff ) != pi_buffer[i] )
+ {
+ break;
+ }
+
+ i_t5 >>= 8;
}
- if( i == KEYSTREAMBYTES )
+ if( i == 10 )
{
/* Do 4 backwards steps of iterating t3 to deduce initial state */
- t3 = vCandidate;
+ i_t3 = i_candidate;
for( i = 0 ; i < 4 ; i++ )
{
- t1 = t3 & 0xff;
- t3 = ( t3 >> 8 );
+ i_t1 = i_t3 & 0xff;
+ i_t3 = ( i_t3 >> 8 );
/* easy to code, and fast enough bruteforce
* search for byte shifted in */
- for( j=0 ; j < 256 ; j++ )
+ for( j = 0 ; j < 256 ; j++ )
{
- t3 = (t3 & 0x1ffff) | ( j << 17 );
- t6=(((((((t3>>3)^t3)>>1)^t3)>>8)^t3)>>5)&0xff;
- if( t6 == t1 ) break;
+ i_t3 = ( i_t3 & 0x1ffff) | ( j << 17 );
+ i_t6 = ((((((( i_t3 >> 3 ) ^ i_t3 ) >> 1 ) ^
+ i_t3 ) >> 8 ) ^ i_t3 ) >> 5 ) & 0xff;
+ if( i_t6 == i_t1 )
+ {
+ break;
+ }
}
}
-// printf( "Candidate: t1=%03x t2=%02x t3=%08x\n", 0x100|(nTry>>8),nTry&0x0ff, t3 );
- t4 = (t3>>1) - 4;
- for(t5=0;t5<8;t5++)
+ i_t4 = ( i_t3 >> 1 ) - 4;
+ for( i_t5 = 0 ; i_t5 < 8; i_t5++ )
{
- if ( ((t4+t5)*2 + 8 - ((t4+t5)&7))==t3 )
+ if( ( ( i_t4 + i_t5 ) * 2 + 8 - ( (i_t4 + i_t5 ) & 7 ) )
+ == i_t3 )
{
- (*pkey)[0] = nTry>>8;
- (*pkey)[1] = nTry & 0xFF;
- (*pkey)[2] = ((t4+t5) >> 0) & 0xFF;
- (*pkey)[3] = ((t4+t5) >> 8) & 0xFF;
- (*pkey)[4] = ((t4+t5) >> 16) & 0xFF;
- i_exit = nTry+1;
+ (*p_key)[0] = i_try>>8;
+ (*p_key)[1] = i_try & 0xFF;
+ (*p_key)[2] = ( ( i_t4 + i_t5 ) >> 0) & 0xFF;
+ (*p_key)[3] = ( ( i_t4 + i_t5 ) >> 8) & 0xFF;
+ (*p_key)[4] = ( ( i_t4 + i_t5 ) >> 16) & 0xFF;
+ i_exit = i_try + 1;
}
}
}
}
- if (i_exit>=0)
+ if( i_exit >= 0 )
{
- (*pkey)[0] ^= (*StreamKey)[0];
- (*pkey)[1] ^= (*StreamKey)[1];
- (*pkey)[2] ^= (*StreamKey)[2];
- (*pkey)[3] ^= (*StreamKey)[3];
- (*pkey)[4] ^= (*StreamKey)[4];
+ (*p_key)[0] ^= (*p_sector_key)[0];
+ (*p_key)[1] ^= (*p_sector_key)[1];
+ (*p_key)[2] ^= (*p_sector_key)[2];
+ (*p_key)[3] ^= (*p_sector_key)[3];
+ (*p_key)[4] ^= (*p_sector_key)[4];
}
return i_exit;
dvd.type = DVD_STRUCT_COPYRIGHT;
dvd.copyright.layer_num = 0;
- if( ioctl( i_fd, DVD_READ_STRUCT, &dvd ) < 0 )
+ if( dvd_ioctl( i_fd, DVD_READ_STRUCT, &dvd ) < 0 )
{
intf_ErrMsg( "DVD ioctl error" );
return -1;
/*****************************************************************************
* CSSInit : CSS Structure initialisation and DVD authentication.
+ * It simulates the mutual authentication between logical unit and host.
+ * ---
+ * Since we don't need the disc key to find the title key, we just run the
+ * basic unavoidable commands to authenticate device and disc.
*****************************************************************************/
css_t CSSInit( int i_fd )
{
- dvd_authinfo ai;
+ /* structures defined in cdrom.h or dvdio.h */
+ dvd_authinfo auth_info;
dvd_struct dvd;
+
css_t css;
- int rv = -1;
+ int i_error = -1;
int i;
css.i_fd = i_fd;
+ css.b_error = 0;
- memset( &ai, 0, sizeof(ai) );
-
-// if (CSSGetASF (i_fd))
-// return css;
+ memset( &auth_info, 0, sizeof(auth_info) );
+ /* Test authentication success */
+ switch( CSSGetASF( i_fd ) )
+ {
+ case -1:
+ css.b_error = 1;
+ case 1:
+ return css;
+ case 0:
+ intf_WarnMsg( 3, "CSS: Authenticating" );
+ }
/* Init sequence, request AGID */
- for( i=1; (i<4)&&(rv== -1) ; ++i )
+ for( i = 1; i < 4 ; ++i )
{
- intf_WarnMsg( 3, "CSS: Request AGID [%d]...", i );
- ai.type = DVD_LU_SEND_AGID;
- ai.lsa.agid = 0;
- rv = ioctl (i_fd, DVD_AUTH, &ai);
- if (rv == -1)
+ intf_WarnMsg( 3, "CSS: Request AGID %d", i );
+ auth_info.type = DVD_LU_SEND_AGID;
+ auth_info.lsa.agid = 0;
+ i_error = dvd_ioctl( i_fd, DVD_AUTH, &auth_info );
+ if( i_error != -1 )
{
- intf_ErrMsg( "CSS: N/A, invalidating" );
- ai.type = DVD_INVALIDATE_AGID;
- ai.lsa.agid = 0;
- ioctl( i_fd, DVD_AUTH, &ai );
+ /* No error during ioctl: we know if device
+ * is authenticated */
+ break;
}
+
+ intf_ErrMsg( "CSS: AGID N/A, invalidating" );
+ auth_info.type = DVD_INVALIDATE_AGID;
+ auth_info.lsa.agid = 0;
+ dvd_ioctl( i_fd, DVD_AUTH, &auth_info );
}
- if( rv==-1 )
+
+ /* Unable to authenticate without AGID */
+ if( i_error == -1 )
{
- intf_ErrMsg( "CSS: Cannot get AGID\n" );
+ css.b_error = 1;
+ intf_ErrMsg( "CSS: Cannot get AGID" );
+ return css;
}
- for( i=0 ; i<10; ++i )
+ for( i = 0 ; i < 10; ++i )
{
css.disc.pi_challenge[i] = i;
}
/* Send AGID to host */
- if( CSSAuthHost(&ai, &(css.disc) )<0 )
- {
- intf_ErrMsg( "CSS Error: Send AGID to host failed" );
- return css;
- }
+ auth_info.type = DVD_HOST_SEND_CHALLENGE;
/* Get challenge from host */
- if( CSSAuthHost( &ai, &(css.disc) )<0)
+ for( i = 0 ; i < 10 ; ++i )
{
- intf_ErrMsg( "CSS Error: Get challenge from host failed" );
- return css;
+ auth_info.hsc.chal[9-i] = css.disc.pi_challenge[i];
}
- css.i_agid = ai.lsa.agid;
+ /* Returning data, let LU change state */
+ css.i_agid = auth_info.lsa.agid;
/* Send challenge to LU */
- if( ioctl( i_fd, DVD_AUTH, &ai )<0 )
+ if( dvd_ioctl( i_fd, DVD_AUTH, &auth_info )<0 )
{
- intf_ErrMsg( "CSS Error: Send challenge to LU failed ");
+ intf_ErrMsg( "CSS: Send challenge to LU failed ");
+ css.b_error = 1;
return css;
}
/* Get key1 from LU */
- if( ioctl( i_fd, DVD_AUTH, &ai )<0)
+ if( dvd_ioctl( i_fd, DVD_AUTH, &auth_info ) < 0)
{
- intf_ErrMsg( "CSS Error: Get key1 from LU failed ");
+ intf_ErrMsg( "CSS: Get key1 from LU failed ");
+ css.b_error = 1;
return css;
}
/* Send key1 to host */
-// if (_CSSAuthHost(&ai, disc) < 0) {
- if( CSSAuthHost( &ai, &(css.disc) )<0)
+ for( i = 0 ; i < KEY_SIZE ; i++ )
+ {
+ css.disc.pi_key1[i] = auth_info.lsk.key[4-i];
+ }
+
+ for( i = 0 ; i < 32 ; ++i )
+ {
+ CSSCryptKey( 0, i, css.disc.pi_challenge,
+ css.disc.pi_key_check );
+
+ if( memcmp( css.disc.pi_key_check,
+ css.disc.pi_key1, KEY_SIZE ) == 0 )
+ {
+ intf_WarnMsg( 3, "CSS: Drive Authentic - using varient %d", i);
+ css.disc.i_varient = i;
+ auth_info.type = DVD_LU_SEND_CHALLENGE;
+ break;
+ }
+ }
+
+ if( i == 32 )
{
- intf_ErrMsg( "CSS Error: Send key1 to host failed" );
+ intf_ErrMsg( "Drive would not Authenticate" );
+ auth_info.type = DVD_AUTH_FAILURE;
+ css.b_error = 1;
return css;
}
/* Get challenge from LU */
- if( ioctl( i_fd, DVD_AUTH, &ai)<0 )
+ if( dvd_ioctl( i_fd, DVD_AUTH, &auth_info ) < 0 )
{
- intf_ErrMsg( "CSS Error: Get challenge from LU failed ");
+ intf_ErrMsg( "CSS: Get challenge from LU failed ");
+ css.b_error = 1;
return css;
}
/* Send challenge to host */
- if( CSSAuthHost( &ai, &(css.disc) )<0 )
+ for( i = 0 ; i < 10 ; ++i )
{
- intf_ErrMsg( "CSS Error: Send challenge to host failed");
- return css;
+ css.disc.pi_challenge[i] = auth_info.hsc.chal[9-i];
}
+ CSSCryptKey( 1, css.disc.i_varient, css.disc.pi_challenge,
+ css.disc.pi_key2 );
+ auth_info.type = DVD_HOST_SEND_KEY2;
+
/* Get key2 from host */
- if( CSSAuthHost( &ai, &(css.disc) )<0 )
+ for( i = 0 ; i < KEY_SIZE ; ++i )
{
- intf_ErrMsg( "CSS Error: Get key2 from host failed" );
- return css;
+ auth_info.hsk.key[4-i] = css.disc.pi_key2[i];
}
+ /* Returning data, let LU change state */
/* Send key2 to LU */
- if( ioctl( i_fd, DVD_AUTH, &ai )<0 )
+ if( dvd_ioctl( i_fd, DVD_AUTH, &auth_info ) < 0 )
{
- intf_ErrMsg( "CSS Error: Send key2 to LU failed (expected)" );
+ intf_ErrMsg( "CSS: Send key2 to LU failed (expected)" );
return css;
}
- if( ai.type == DVD_AUTH_ESTABLISHED )
+ if( auth_info.type == DVD_AUTH_ESTABLISHED )
{
- intf_WarnMsg( 3, "DVD is authenticated");
+ intf_WarnMsg( 3, "CSS: Authentication established");
}
- else if( ai.type == DVD_AUTH_FAILURE )
+ else if( auth_info.type == DVD_AUTH_FAILURE )
{
- intf_ErrMsg("CSS Error: DVD authentication failed");
+ css.b_error = 1;
+ intf_ErrMsg("CSS: DVD authentication failed");
}
memcpy( css.disc.pi_challenge, css.disc.pi_key1, KEY_SIZE );
css.disc.pi_challenge,
css.disc.pi_key_check );
- intf_WarnMsg( 3, "CSS: Received Session Key\n" );
+ intf_WarnMsg( 1, "CSS: Received Session Key" );
if( css.i_agid < 0 )
{
+ css.b_error = 1;
return css;
}
-// if (CSSGetASF (i_fd) < 0)
-// return css;
+ /* Test authentication success */
+ switch( CSSGetASF( i_fd ) )
+ {
+ case -1:
+ css.b_error = 1;
+ case 1:
+ return css;
+ case 0:
+ intf_WarnMsg( 3, "CSS: Getting disc key" );
+ }
+ /* Get encrypted disc key */
dvd.type = DVD_STRUCT_DISCKEY;
dvd.disckey.agid = css.i_agid;
memset( dvd.disckey.value, 0, 2048 );
- if( ioctl( i_fd, DVD_READ_STRUCT, &dvd )<0 )
+ if( dvd_ioctl( i_fd, DVD_READ_STRUCT, &dvd ) < 0 )
{
- intf_ErrMsg( "CSS Error: Could not read Disc Key" );
+ intf_ErrMsg( "CSS: Could not read Disc Key" );
css.b_error = 1;
return css;
}
-
- for (i=0; i<sizeof dvd.disckey.value; i++)
+#if 1
+ /* Unencrypt disc key using bus key */
+ for( i = 0 ; i < sizeof(dvd.disckey.value) ; i++ )
{
dvd.disckey.value[i] ^= css.disc.pi_key_check[4 - (i % KEY_SIZE)];
}
memcpy( css.disc.pi_key_check, dvd.disckey.value, 2048 );
-//
-// if (CSSGetASF (i_fd) < 0)
-// {
-// css.b_error = 1;
-// return css;
-// }
+#endif
+ /* Test authentication success */
+ switch( CSSGetASF( i_fd ) )
+ {
+ case -1:
+ case 0:
+ css.b_error = 1;
+ case 1:
+ return css;
+ }
return css;
}
/*****************************************************************************
- * CSSGetKeys : get the disc key of the media en the dvd device, and then
- * the title keys.
- * The DVD should have been opened before.
+ * CSSGetKey : get title key.
+ * The DVD should have been opened and authenticated before.
*****************************************************************************/
-#define MaxKeys 1000
-#define REPEAT 2
-
-int CSSGetKeys( css_t * p_css )
+int CSSGetKey( css_t * p_css )
{
-#if 0
-
- /*
- * css_auth/libcss method from Derek Fawcus.
- * Get encrypted keys with ioctls and decrypt them
- * with cracked player keys
+ /*
+ * Title key cracking method from Ethan Hawke,
+ * with Frank A. Stevenson algorithm.
+ * Does not use any player key table and ioctls.
*/
- dvd_struct dvd;
- dvd_authinfo auth;
- int i, j;
- if( CSSGetASF( p_css->i_fd ) < 0 )
- {
- return 1;
- }
-
- /* Disk key */
- dvd.type = DVD_STRUCT_DISCKEY;
- dvd.disckey.agid = p_css->i_agid;
- memset( dvd.disckey.value, 0, 2048 );
-
- if( ioctl( p_css->i_fd, DVD_READ_STRUCT, &dvd )<0 )
- {
- intf_ErrMsg( "DVD ioctl error in CSSGetKeys" );
- p_css->b_error = 1;
- return 1;
- }
+ u8 pi_buf[0x800];
+ dvd_key_t pi_key;
+ title_key_t p_title_key[10];
+ off_t i_pos;
+ boolean_t b_encrypted;
+ boolean_t b_stop_scanning;
+ int i_title;
+ int i_bytes_read;
+ int i_best_plen;
+ int i_best_p;
+ int i_registered_keys;
+ int i_total_keys_found;
+ int i_highest;
+ int i,j,k;
- for( i=0 ; i<sizeof(dvd.disckey.value) ; i++ )
- {
- dvd.disckey.value[i] ^=
- p_css->keys.pi_key_check[4 - (i % KEY_SIZE )];
- }
+ memset( p_title_key, 0, 10 );
+ memset( &pi_key, 0, 10 );
+ b_encrypted = 0;
+ b_stop_scanning = 0;
+ i_registered_keys = 0 ;
+ i_total_keys_found = 0 ;
+ i_highest = 0;
- memcpy( p_css->pi_disc_key, dvd.disckey.value, 2048 );
+ /* Position of the title on the disc */
+ i_title = p_css->i_title;
+ i_pos = p_css->i_title_pos;
- if( CSSGetASF( p_css->i_fd ) < 0 )
- {
- return 1;
- }
+//fprintf( stderr, "CSS %d start pos: %lld\n", i_title, i_pos );
- /* Title keys */
- auth.type = DVD_LU_SEND_TITLE_KEY;
- auth.lstk.agid = p_css->i_agid;
+ do {
+ i_pos = lseek( p_css->i_fd, i_pos, SEEK_SET );
+ i_bytes_read = read( p_css->i_fd, pi_buf, 0x800 );
- for( j=0 ; j<p_css->i_title_nb ; j++ )
+ /* PES_scrambling_control */
+ if( pi_buf[0x14] & 0x30 )
{
- auth.lstk.lba = p_css->p_title_key[j].i_lba;
+ b_encrypted = 1;
+ i_best_plen = 0;
+ i_best_p = 0;
- if( ioctl( p_css->i_fd, DVD_AUTH, &auth )<0 )
- {
- intf_ErrMsg( "DVD ioctl error in CSSGetKeys" );
- p_css->b_error = 1;
- return 1;
- }
-
- for( i=0 ; i<KEY_SIZE ; ++i )
+ for( i = 2 ; i < 0x30 ; i++ )
{
- auth.lstk.title_key[i] ^=
- p_css->keys.pi_key_check[4 - (i % KEY_SIZE)];
- memcpy( p_css->p_title_key[j].key, auth.lstk.title_key, KEY_SIZE );
+ for( j = i ; ( j < 0x80 ) &&
+ ( pi_buf[0x7F - (j%i)] == pi_buf[0x7F-j] ) ; j++ );
+ {
+ if( ( j > i_best_plen ) && ( j > i ) )
+ {
+ i_best_plen = j;
+ i_best_p = i;
+ }
+ }
}
- }
-
- if( CSSGetASF( p_css->i_fd ) < 0 )
- {
- return 1;
- }
-
-#endif
-#if 1
- /*
- * Cracking method from Ethan Hawke.
- * Does not use key tables and ioctls.
- */
- u8 pi_buf[0x800] ;
- DVD_key_t my_key;
- title_key_t title_key[MaxKeys] ;
- int i_title;
- off_t i_pos = 0;
- int i_bytes_read;
- int i_best_plen;
- int i_best_p;
- int i,j,k;
- int i_registered_keys = 0 ;
- int i_total_keys_found = 0 ;
- int i_highest=0 ;
- boolean_t b_encrypted = 0;
- boolean_t b_stop_scanning = 0 ;
-
- int i_fd = p_css->i_fd;
-
- for( i_title=0 ; i_title<1/*p_css->i_title_nb*/ ; i_title++ )
- {
- i_pos = p_css->p_title_key[i_title].i;
- do
+ if( ( i_best_plen > 20 ) && ( i_best_plen / i_best_p >= 2) )
{
- i_pos = lseek( i_fd, i_pos, SEEK_SET );
- i_bytes_read = read( i_fd, pi_buf, 0x800 );
- if( pi_buf[0x14] & 0x30 ) // PES_scrambling_control
+ i = CSSCracker( 0, &pi_buf[0x80],
+ &pi_buf[0x80 - ( i_best_plen / i_best_p) *i_best_p],
+ (dvd_key_t*)&pi_buf[0x54],
+ &pi_key );
+ while( i>=0 )
{
- b_encrypted = 1;
- i_best_plen = 0;
- i_best_p = 0;
- for( i=2 ; i<0x30 ; i++ )
+ k = 0;
+ for( j=0 ; j<i_registered_keys ; j++ )
{
- for( j=i ; (j<0x80) &&
- (pi_buf[0x7F - (j%i)] == pi_buf[0x7F-j]) ; j++ );
- if( (j>i_best_plen) && (j>i) )
+ if( memcmp( &(p_title_key[j].pi_key),
+ &pi_key, sizeof(dvd_key_t) ) == 0 )
{
- i_best_plen = j;
- i_best_p = i;
+ p_title_key[j].i_occ++;
+ i_total_keys_found++;
+ k = 1;
}
}
- if( (i_best_plen>20) && (i_best_plen / i_best_p >= 2) )
+
+ if( k == 0 )
{
- i = CSScracker( 0, &pi_buf[0x80],
- &pi_buf[0x80 - ( i_best_plen / i_best_p) *i_best_p],
- (DVD_key_t*)&pi_buf[0x54],
- &my_key );
- while( i>=0 )
- {
- k = 0;
- for( j=0 ; j<i_registered_keys ; j++ )
- {
- if( memcmp( &(title_key[j].key),
- &my_key, sizeof(DVD_key_t) ) == 0 )
- {
- title_key[j].i++;
- i_total_keys_found++;
- k = 1;
- }
- }
- if( k == 0 )
- {
- memcpy( &( title_key[i_registered_keys].key),
- &my_key,
- sizeof(DVD_key_t) );
- title_key[i_registered_keys++].i = 1;
- i_total_keys_found++;
- }
- i = CSScracker( i, &pi_buf[0x80],
- &pi_buf[0x80 -( i_best_plen / i_best_p) *i_best_p],
- (DVD_key_t*)&pi_buf[0x54], &my_key);
- }
- if( i_registered_keys == 1 && title_key[0].i >= REPEAT )
- {
- b_stop_scanning = 1;
- }
+ memcpy( &(p_title_key[i_registered_keys].pi_key),
+ &pi_key, sizeof(dvd_key_t) );
+ p_title_key[i_registered_keys++].i_occ = 1;
+ i_total_keys_found++;
}
+ i = CSSCracker( i, &pi_buf[0x80],
+ &pi_buf[0x80 - ( i_best_plen / i_best_p) *i_best_p],
+ (dvd_key_t*)&pi_buf[0x54], &pi_key);
}
- i_pos += i_bytes_read;
- } while( i_bytes_read == 0x800 && !b_stop_scanning);
-
- if( b_stop_scanning)
- {
- intf_WarnMsg( 3,
- "CSS: Found enough occurancies of the same key." );
- }
- if( !b_encrypted )
- {
- intf_WarnMsg( 3, "CSS: This file was _NOT_ encrypted!");
- return(0);
- }
- if( b_encrypted && i_registered_keys == 0 )
- {
- intf_WarnMsg( 3 , "CSS: Unable to determine keys from file.");
- return(1);
- }
- for( i=0 ; i<i_registered_keys-1 ; i++ )
- {
- for( j=i+1 ; j<i_registered_keys ; j++ )
+
+ /* Stop search if we find one occurance of the key
+ * I have never found a DVD for which it is not enough
+ * but we should take care of that */
+ if( i_registered_keys == 1 && p_title_key[0].i_occ >= 1 )
{
- if( title_key[j].i > title_key[i].i )
- {
- memcpy( &my_key, &(title_key[j].key), sizeof(DVD_key_t) );
- k = title_key[j].i;
- memcpy( &(title_key[j].key),
- &(title_key[i].key), sizeof(DVD_key_t) );
- title_key[j].i = title_key[i].i;
- memcpy( &(title_key[i].key),&my_key, sizeof(DVD_key_t) );
- title_key[i].i = k;
- }
+ b_stop_scanning = 1;
}
}
- i_highest = 0;
-#if 0
- fprintf(stderr, " Key(s) & key probability\n---------------------\n");
- for( i=0 ; i<i_registered_keys ; i++ )
+ }
+
+ i_pos += i_bytes_read;
+ } while( i_bytes_read == 0x800 && !b_stop_scanning);
+
+ if( b_stop_scanning)
+ {
+ intf_WarnMsg( 1,
+ "CSS: Found enough occurancies of the same key." );
+ }
+
+ if( !b_encrypted )
+ {
+ intf_WarnMsg( 3, "CSS: This file was _NOT_ encrypted!");
+ return(0);
+ }
+
+ if( b_encrypted && i_registered_keys == 0 )
+ {
+ intf_ErrMsg( "CSS: Unable to determine keys from file.");
+ return(1);
+ }
+
+ for( i = 0 ; i < i_registered_keys - 1 ; i++ )
+ {
+ for( j = i + 1 ; j < i_registered_keys ; j++ )
{
- fprintf(stderr, "%d) %02X %02X %02X %02X %02X - %3.2f%%\n", i,
- title_key[i].key[0], title_key[i].key[1],
- title_key[i].key[2], title_key[i].key[3],
- title_key[i].key[4],
- title_key[i].i * 100.0 / i_total_keys_found );
- if( title_key[i_highest].i * 100.0 / i_total_keys_found
- <= title_key[i].i*100.0 / i_total_keys_found )
+ if( p_title_key[j].i_occ > p_title_key[i].i_occ )
{
- i_highest = i;
+ memcpy( &pi_key, &(p_title_key[j].pi_key), sizeof(dvd_key_t) );
+ k = p_title_key[j].i_occ;
+
+ memcpy( &(p_title_key[j].pi_key),
+ &(p_title_key[i].pi_key), sizeof(dvd_key_t) );
+ p_title_key[j].i_occ = p_title_key[i].i_occ;
+
+ memcpy( &(p_title_key[i].pi_key),&pi_key, sizeof(dvd_key_t) );
+ p_title_key[i].i_occ = k;
}
}
- fprintf(stderr, "\n");
-#endif
-
- /* The "find the key with the highest probability" code
- * is untested, as I haven't been able to find a VOB that
- * produces multiple keys (RT)
- */
- intf_WarnMsg( 3, "CSS: Title %d key: %02X %02X %02X %02X %02X\n",
- i_title+1,
- title_key[i_highest].key[0],
- title_key[i_highest].key[1],
- title_key[i_highest].key[2],
- title_key[i_highest].key[3],
- title_key[i_highest].key[4] );
-
- memcpy( p_css->p_title_key[i_title].key,
- title_key[i_highest].key, KEY_SIZE );
}
+
+#ifdef STATS
+ intf_WarnMsg( 1, " Key(s) & key probability\n---------------------");
+#endif
+ for( i=0 ; i<i_registered_keys ; i++ )
+ {
+#ifdef STATS
+ intf_WarnMsg( 1, "%d) %02X %02X %02X %02X %02X - %3.2f%%", i,
+ p_title_key[i].key[0], p_title_key[i].key[1],
+ p_title_key[i].key[2], p_title_key[i].key[3],
+ p_title_key[i].key[4],
+ p_title_key[i].i_occ * 100.0 / i_total_keys_found );
#endif
+ if( p_title_key[i_highest].i_occ * 100.0 / i_total_keys_found
+ <= p_title_key[i].i_occ*100.0 / i_total_keys_found )
+ {
+ i_highest = i;
+ }
+ }
+
+
+ /* The "find the key with the highest probability" code
+ * is untested, as I haven't been able to find a VOB that
+ * produces multiple keys (RT)
+ */
+ intf_WarnMsg( 3, "CSS: Title %d key: %02X %02X %02X %02X %02X",
+ i_title + 1,
+ p_title_key[i_highest].pi_key[0],
+ p_title_key[i_highest].pi_key[1],
+ p_title_key[i_highest].pi_key[2],
+ p_title_key[i_highest].pi_key[3],
+ p_title_key[i_highest].pi_key[4] );
+
+ memcpy( p_css->pi_title_key,
+ p_title_key[i_highest].pi_key, KEY_SIZE );
+
return 0;
}
* sec : sector to descramble
* key : title key for this sector
*****************************************************************************/
-int CSSDescrambleSector( DVD_key_t key, u8* pi_sec )
+int CSSDescrambleSector( dvd_key_t pi_key, u8* pi_sec )
{
unsigned int i_t1, i_t2, i_t3, i_t4, i_t5, i_t6;
u8* pi_end = pi_sec + 0x800;
- if( pi_sec[0x14] & 0x30) // PES_scrambling_control
+ /* PES_scrambling_control */
+ if( pi_sec[0x14] & 0x30)
{
- i_t1 = ((key)[0] ^ pi_sec[0x54]) | 0x100;
- i_t2 = (key)[1] ^ pi_sec[0x55];
- i_t3 = (((key)[2]) | ((key)[3] << 8) |
- ((key)[4] << 16)) ^ ((pi_sec[0x56]) |
+ i_t1 = ((pi_key)[0] ^ pi_sec[0x54]) | 0x100;
+ i_t2 = (pi_key)[1] ^ pi_sec[0x55];
+ i_t3 = (((pi_key)[2]) | ((pi_key)[3] << 8) |
+ ((pi_key)[4] << 16)) ^ ((pi_sec[0x56]) |
(pi_sec[0x57] << 8) | (pi_sec[0x58] << 16));
i_t4 = i_t3 & 7;
i_t3 = i_t3 * 2 + 8 - i_t4;
projects / vlc / blobdiff