subs: change subdelay handling and vobsub timing
[mplayer/glamo.git] / libdvdcss / css.c
blob264f43a1a958b75a1b80455292e5ab5741f813e5
1 /*****************************************************************************
2 * css.c: Functions for DVD authentication and descrambling
3 *****************************************************************************
4 * Copyright (C) 1999-2008 VideoLAN
5 * $Id$
7 * Authors: Stéphane Borel <stef@via.ecp.fr>
8 * Håkan Hjort <d95hjort@dtek.chalmers.se>
10 * based on:
11 * - css-auth by Derek Fawcus <derek@spider.com>
12 * - DVD CSS ioctls example program by Andrew T. Veliath <andrewtv@usa.net>
13 * - The Divide and conquer attack by Frank A. Stevenson <frank@funcom.com>
14 * (see http://www-2.cs.cmu.edu/~dst/DeCSS/FrankStevenson/index.html)
15 * - DeCSSPlus by Ethan Hawke
16 * - DecVOB
17 * see http://www.lemuria.org/DeCSS/ by Tom Vogt for more information.
19 * This library is free software; you can redistribute it and/or modify
20 * it under the terms of the GNU General Public License as published by
21 * the Free Software Foundation; either version 2 of the License, or
22 * (at your option) any later version.
24 * This library is distributed in the hope that it will be useful,
25 * but WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27 * GNU General Public License for more details.
29 * You should have received a copy of the GNU General Public License along
30 * with this library; if not, write to the Free Software Foundation, Inc.,
31 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
32 *****************************************************************************/
34 /*****************************************************************************
35 * Preamble
36 *****************************************************************************/
37 #include "config.h"
39 #include <stdio.h>
40 #include <stdlib.h>
41 #include <string.h>
42 #include <sys/types.h>
43 #include <sys/stat.h>
44 #ifdef HAVE_SYS_PARAM_H
45 # include <sys/param.h>
46 #endif
47 #ifdef HAVE_UNISTD_H
48 # include <unistd.h>
49 #endif
50 #include <fcntl.h>
52 #ifdef HAVE_LIMITS_H
53 # include <limits.h>
54 #endif
56 #include "dvdcss/dvdcss.h"
58 #include "common.h"
59 #include "css.h"
60 #include "libdvdcss.h"
61 #include "csstables.h"
62 #include "ioctl.h"
63 #include "device.h"
65 /*****************************************************************************
66 * Local prototypes
67 *****************************************************************************/
68 static void PrintKey ( dvdcss_t, char *, uint8_t const * );
70 static int GetBusKey ( dvdcss_t );
71 static int GetASF ( dvdcss_t );
73 static void CryptKey ( int, int, uint8_t const *, uint8_t * );
74 static void DecryptKey ( uint8_t,
75 uint8_t const *, uint8_t const *, uint8_t * );
77 static int DecryptDiscKey ( dvdcss_t, uint8_t const *, dvd_key_t );
78 static int CrackDiscKey ( dvdcss_t, uint8_t * );
80 static void DecryptTitleKey ( dvd_key_t, dvd_key_t );
81 static int RecoverTitleKey ( int, uint8_t const *,
82 uint8_t const *, uint8_t const *, uint8_t * );
83 static int CrackTitleKey ( dvdcss_t, int, int, dvd_key_t );
85 static int AttackPattern ( uint8_t const[], int, uint8_t * );
86 #if 0
87 static int AttackPadding ( uint8_t const[], int, uint8_t * );
88 #endif
90 /*****************************************************************************
91 * _dvdcss_test: check if the disc is encrypted or not
92 *****************************************************************************
93 * Return values:
94 * 1: DVD is scrambled but can be read
95 * 0: DVD is not scrambled and can be read
96 * -1: could not get "copyright" information
97 * -2: could not get RPC information (reading the disc might be possible)
98 * -3: drive is RPC-II, region is not set, and DVD is scrambled: the RPC
99 * scheme will prevent us from reading the scrambled data
100 *****************************************************************************/
101 int _dvdcss_test( dvdcss_t dvdcss )
103 char const *psz_type, *psz_rpc;
104 int i_ret, i_copyright, i_type, i_mask, i_rpc;
106 i_ret = ioctl_ReadCopyright( dvdcss->i_fd, 0 /* i_layer */, &i_copyright );
108 #ifdef WIN32
109 if( i_ret < 0 )
111 /* Maybe we didn't have enough privileges to read the copyright
112 * (see ioctl_ReadCopyright comments).
113 * Apparently, on unencrypted DVDs _dvdcss_disckey() always fails, so
114 * we can check this as a workaround. */
115 i_ret = 0;
116 i_copyright = 1;
117 if( _dvdcss_disckey( dvdcss ) < 0 )
119 i_copyright = 0;
122 #endif
124 if( i_ret < 0 )
126 /* Since it's the first ioctl we try to issue, we add a notice */
127 print_error( dvdcss, "css error: could not get \"copyright\""
128 " information, make sure there is a DVD in the drive,"
129 " and that you have used the correct device node." );
131 return -1;
134 print_debug( dvdcss, "disc reports copyright information 0x%x",
135 i_copyright );
137 i_ret = ioctl_ReportRPC( dvdcss->i_fd, &i_type, &i_mask, &i_rpc);
139 if( i_ret < 0 )
141 print_error( dvdcss, "css error: could not get RPC status" );
142 return -2;
145 switch( i_rpc )
147 case 0: psz_rpc = "RPC-I"; break;
148 case 1: psz_rpc = "RPC-II"; break;
149 default: psz_rpc = "unknown RPC scheme"; break;
152 switch( i_type )
154 case 0: psz_type = "no region code set"; break;
155 case 1: psz_type = "region code set"; break;
156 case 2: psz_type = "one region change remaining"; break;
157 case 3: psz_type = "region code set permanently"; break;
158 default: psz_type = "unknown status"; break;
161 print_debug( dvdcss, "drive region mask 0x%x, %s, %s",
162 i_mask, psz_rpc, psz_type );
164 if( i_copyright && i_rpc == 1 && i_type == 0 )
166 print_error( dvdcss, "css error: drive will prevent access to "
167 "scrambled data" );
168 return -3;
171 return i_copyright ? 1 : 0;
174 /*****************************************************************************
175 * _dvdcss_title: crack or decrypt the current title key if needed
176 *****************************************************************************
177 * This function should only be called by dvdcss->pf_seek and should eventually
178 * not be external if possible.
179 *****************************************************************************/
180 int _dvdcss_title ( dvdcss_t dvdcss, int i_block )
182 dvd_title_t *p_title;
183 dvd_title_t *p_newtitle;
184 dvd_key_t p_title_key;
185 int i_fd, i_ret = -1, b_cache = 0;
187 if( ! dvdcss->b_scrambled )
189 return 0;
192 /* Check if we've already cracked this key */
193 p_title = dvdcss->p_titles;
194 while( p_title != NULL
195 && p_title->p_next != NULL
196 && p_title->p_next->i_startlb <= i_block )
198 p_title = p_title->p_next;
201 if( p_title != NULL
202 && p_title->i_startlb == i_block )
204 /* We've already cracked this key, nothing to do */
205 memcpy( dvdcss->css.p_title_key, p_title->p_key, sizeof(dvd_key_t) );
206 return 0;
209 /* Check whether the key is in our disk cache */
210 if( dvdcss->psz_cachefile[0] )
212 /* XXX: be careful, we use sprintf and not snprintf */
213 sprintf( dvdcss->psz_block, "%.10x", i_block );
214 i_fd = open( dvdcss->psz_cachefile, O_RDONLY );
215 b_cache = 1;
217 if( i_fd >= 0 )
219 char psz_key[KEY_SIZE * 3];
220 unsigned int k0, k1, k2, k3, k4;
222 psz_key[KEY_SIZE * 3 - 1] = '\0';
224 if( read( i_fd, psz_key, KEY_SIZE * 3 - 1 ) == KEY_SIZE * 3 - 1
225 && sscanf( psz_key, "%x:%x:%x:%x:%x",
226 &k0, &k1, &k2, &k3, &k4 ) == 5 )
228 p_title_key[0] = k0;
229 p_title_key[1] = k1;
230 p_title_key[2] = k2;
231 p_title_key[3] = k3;
232 p_title_key[4] = k4;
233 PrintKey( dvdcss, "title key found in cache ", p_title_key );
235 /* Don't try to save it again */
236 b_cache = 0;
237 i_ret = 1;
240 close( i_fd );
244 /* Crack or decrypt CSS title key for current VTS */
245 if( i_ret < 0 )
247 i_ret = _dvdcss_titlekey( dvdcss, i_block, p_title_key );
249 if( i_ret < 0 )
251 print_error( dvdcss, "fatal error in vts css key" );
252 return i_ret;
255 if( i_ret == 0 )
257 print_debug( dvdcss, "unencrypted title" );
258 /* We cache this anyway, so we don't need to check again. */
262 /* Key is valid, we store it on disk. */
263 if( dvdcss->psz_cachefile[0] && b_cache )
265 i_fd = open( dvdcss->psz_cachefile, O_RDWR|O_CREAT, 0644 );
266 if( i_fd >= 0 )
268 char psz_key[KEY_SIZE * 3 + 2];
270 sprintf( psz_key, "%02x:%02x:%02x:%02x:%02x\r\n",
271 p_title_key[0], p_title_key[1], p_title_key[2],
272 p_title_key[3], p_title_key[4] );
274 write( i_fd, psz_key, KEY_SIZE * 3 + 1 );
275 close( i_fd );
279 /* Find our spot in the list */
280 p_newtitle = NULL;
281 p_title = dvdcss->p_titles;
282 while( ( p_title != NULL ) && ( p_title->i_startlb < i_block ) )
284 p_newtitle = p_title;
285 p_title = p_title->p_next;
288 /* Save the found title */
289 p_title = p_newtitle;
291 /* Write in the new title and its key */
292 p_newtitle = malloc( sizeof( dvd_title_t ) );
293 p_newtitle->i_startlb = i_block;
294 memcpy( p_newtitle->p_key, p_title_key, KEY_SIZE );
296 /* Link it at the head of the (possibly empty) list */
297 if( p_title == NULL )
299 p_newtitle->p_next = dvdcss->p_titles;
300 dvdcss->p_titles = p_newtitle;
302 /* Link the new title inside the list */
303 else
305 p_newtitle->p_next = p_title->p_next;
306 p_title->p_next = p_newtitle;
309 memcpy( dvdcss->css.p_title_key, p_title_key, KEY_SIZE );
310 return 0;
313 /*****************************************************************************
314 * _dvdcss_disckey: get disc key.
315 *****************************************************************************
316 * This function should only be called if DVD ioctls are present.
317 * It will set dvdcss->i_method = DVDCSS_METHOD_TITLE if it fails to find
318 * a valid disc key.
319 * Two decryption methods are offered:
320 * -disc key hash crack,
321 * -decryption with player keys if they are available.
322 *****************************************************************************/
323 int _dvdcss_disckey( dvdcss_t dvdcss )
325 unsigned char p_buffer[ DVD_DISCKEY_SIZE ];
326 dvd_key_t p_disc_key;
327 int i;
329 if( GetBusKey( dvdcss ) < 0 )
331 return -1;
334 /* Get encrypted disc key */
335 if( ioctl_ReadDiscKey( dvdcss->i_fd, &dvdcss->css.i_agid, p_buffer ) < 0 )
337 print_error( dvdcss, "ioctl ReadDiscKey failed" );
338 return -1;
341 /* This should have invaidated the AGID and got us ASF=1. */
342 if( GetASF( dvdcss ) != 1 )
344 /* Region mismatch (or region not set) is the most likely source. */
345 print_error( dvdcss,
346 "ASF not 1 after reading disc key (region mismatch?)" );
347 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
348 return -1;
351 /* Shuffle disc key using bus key */
352 for( i = 0 ; i < DVD_DISCKEY_SIZE ; i++ )
354 p_buffer[ i ] ^= dvdcss->css.p_bus_key[ 4 - (i % KEY_SIZE) ];
357 /* Decrypt disc key */
358 switch( dvdcss->i_method )
360 case DVDCSS_METHOD_KEY:
362 /* Decrypt disc key with player key. */
363 PrintKey( dvdcss, "decrypting disc key ", p_buffer );
364 if( ! DecryptDiscKey( dvdcss, p_buffer, p_disc_key ) )
366 PrintKey( dvdcss, "decrypted disc key is ", p_disc_key );
367 break;
369 print_debug( dvdcss, "failed to decrypt the disc key, "
370 "faulty drive/kernel? "
371 "cracking title keys instead" );
373 /* Fallback, but not to DISC as the disc key might be faulty */
374 memset( p_disc_key, 0, KEY_SIZE );
375 dvdcss->i_method = DVDCSS_METHOD_TITLE;
376 break;
378 case DVDCSS_METHOD_DISC:
380 /* Crack Disc key to be able to use it */
381 memcpy( p_disc_key, p_buffer, KEY_SIZE );
382 PrintKey( dvdcss, "cracking disc key ", p_disc_key );
383 if( ! CrackDiscKey( dvdcss, p_disc_key ) )
385 PrintKey( dvdcss, "cracked disc key is ", p_disc_key );
386 break;
388 print_debug( dvdcss, "failed to crack the disc key" );
389 memset( p_disc_key, 0, KEY_SIZE );
390 dvdcss->i_method = DVDCSS_METHOD_TITLE;
391 break;
393 default:
395 print_debug( dvdcss, "disc key needs not be decrypted" );
396 memset( p_disc_key, 0, KEY_SIZE );
397 break;
400 memcpy( dvdcss->css.p_disc_key, p_disc_key, KEY_SIZE );
402 return 0;
406 /*****************************************************************************
407 * _dvdcss_titlekey: get title key.
408 *****************************************************************************/
409 int _dvdcss_titlekey( dvdcss_t dvdcss, int i_pos, dvd_key_t p_title_key )
411 static uint8_t p_garbage[ DVDCSS_BLOCK_SIZE ]; /* we never read it back */
412 uint8_t p_key[ KEY_SIZE ];
413 int i, i_ret = 0;
415 if( dvdcss->b_ioctls && ( dvdcss->i_method == DVDCSS_METHOD_KEY ||
416 dvdcss->i_method == DVDCSS_METHOD_DISC ) )
418 /* We have a decrypted Disc key and the ioctls are available,
419 * read the title key and decrypt it.
422 print_debug( dvdcss, "getting title key at block %i the classic way",
423 i_pos );
425 /* We need to authenticate again every time to get a new session key */
426 if( GetBusKey( dvdcss ) < 0 )
428 i_ret = -1;
431 /* Get encrypted title key */
432 if( ioctl_ReadTitleKey( dvdcss->i_fd, &dvdcss->css.i_agid,
433 i_pos, p_key ) < 0 )
435 print_debug( dvdcss,
436 "ioctl ReadTitleKey failed (region mismatch?)" );
437 i_ret = -1;
440 /* Test ASF, it will be reset to 0 if we got a Region error */
441 switch( GetASF( dvdcss ) )
443 case -1:
444 /* An error getting the ASF status, something must be wrong. */
445 print_debug( dvdcss, "lost ASF requesting title key" );
446 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
447 i_ret = -1;
448 break;
450 case 0:
451 /* This might either be a title that has no key,
452 * or we encountered a region error. */
453 print_debug( dvdcss, "lost ASF requesting title key" );
454 break;
456 case 1:
457 /* Drive status is ok. */
458 /* If the title key request failed, but we did not loose ASF,
459 * we might stil have the AGID. Other code assume that we
460 * will not after this so invalidate it(?). */
461 if( i_ret < 0 )
463 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
465 break;
468 if( !( i_ret < 0 ) )
470 /* Decrypt title key using the bus key */
471 for( i = 0 ; i < KEY_SIZE ; i++ )
473 p_key[ i ] ^= dvdcss->css.p_bus_key[ 4 - (i % KEY_SIZE) ];
476 /* If p_key is all zero then there really wasn't any key present
477 * even though we got to read it without an error. */
478 if( !( p_key[0] | p_key[1] | p_key[2] | p_key[3] | p_key[4] ) )
480 i_ret = 0;
482 else
484 PrintKey( dvdcss, "initial disc key ", dvdcss->css.p_disc_key );
485 DecryptTitleKey( dvdcss->css.p_disc_key, p_key );
486 PrintKey( dvdcss, "decrypted title key ", p_key );
487 i_ret = 1;
490 /* All went well either there wasn't a key or we have it now. */
491 memcpy( p_title_key, p_key, KEY_SIZE );
492 PrintKey( dvdcss, "title key is ", p_title_key );
494 return i_ret;
497 /* The title key request failed */
498 print_debug( dvdcss, "resetting drive and cracking title key" );
500 /* Read an unscrambled sector and reset the drive */
501 dvdcss->pf_seek( dvdcss, 0 );
502 dvdcss->pf_read( dvdcss, p_garbage, 1 );
503 dvdcss->pf_seek( dvdcss, 0 );
504 _dvdcss_disckey( dvdcss );
506 /* Fallback */
509 /* METHOD is TITLE, we can't use the ioctls or requesting the title key
510 * failed above. For these cases we try to crack the key instead. */
512 /* For now, the read limit is 9Gb / 2048 = 4718592 sectors. */
513 i_ret = CrackTitleKey( dvdcss, i_pos, 4718592, p_key );
515 memcpy( p_title_key, p_key, KEY_SIZE );
516 PrintKey( dvdcss, "title key is ", p_title_key );
518 return i_ret;
521 /*****************************************************************************
522 * _dvdcss_unscramble: does the actual descrambling of data
523 *****************************************************************************
524 * sec : sector to unscramble
525 * key : title key for this sector
526 *****************************************************************************/
527 int _dvdcss_unscramble( dvd_key_t p_key, uint8_t *p_sec )
529 unsigned int i_t1, i_t2, i_t3, i_t4, i_t5, i_t6;
530 uint8_t *p_end = p_sec + DVDCSS_BLOCK_SIZE;
532 /* PES_scrambling_control */
533 if( !(p_sec[0x14] & 0x30) )
535 return 0;
538 i_t1 = (p_key[0] ^ p_sec[0x54]) | 0x100;
539 i_t2 = p_key[1] ^ p_sec[0x55];
540 i_t3 = (p_key[2] | (p_key[3] << 8) |
541 (p_key[4] << 16)) ^ (p_sec[0x56] |
542 (p_sec[0x57] << 8) | (p_sec[0x58] << 16));
543 i_t4 = i_t3 & 7;
544 i_t3 = i_t3 * 2 + 8 - i_t4;
545 p_sec += 0x80;
546 i_t5 = 0;
548 while( p_sec != p_end )
550 i_t4 = p_css_tab2[i_t2] ^ p_css_tab3[i_t1];
551 i_t2 = i_t1>>1;
552 i_t1 = ( ( i_t1 & 1 ) << 8 ) ^ i_t4;
553 i_t4 = p_css_tab5[i_t4];
554 i_t6 = ((((((( i_t3 >> 3 ) ^ i_t3 ) >> 1 ) ^
555 i_t3 ) >> 8 ) ^ i_t3 ) >> 5 ) & 0xff;
556 i_t3 = (i_t3 << 8 ) | i_t6;
557 i_t6 = p_css_tab4[i_t6];
558 i_t5 += i_t6 + i_t4;
559 *p_sec = p_css_tab1[*p_sec] ^ ( i_t5 & 0xff );
560 p_sec++;
561 i_t5 >>= 8;
564 return 0;
567 /* Following functions are local */
569 /*****************************************************************************
570 * GetBusKey : Go through the CSS Authentication process
571 *****************************************************************************
572 * It simulates the mutual authentication between logical unit and host,
573 * and stops when a session key (called bus key) has been established.
574 * Always do the full auth sequence. Some drives seem to lie and always
575 * respond with ASF=1. For instance the old DVD roms on Compaq Armada says
576 * that ASF=1 from the start and then later fail with a 'read of scrambled
577 * block without authentication' error.
578 *****************************************************************************/
579 static int GetBusKey( dvdcss_t dvdcss )
581 uint8_t p_buffer[10];
582 uint8_t p_challenge[2*KEY_SIZE];
583 dvd_key_t p_key1;
584 dvd_key_t p_key2;
585 dvd_key_t p_key_check;
586 uint8_t i_variant = 0;
587 int i_ret = -1;
588 int i;
590 print_debug( dvdcss, "requesting AGID" );
591 i_ret = ioctl_ReportAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
593 /* We might have to reset hung authentication processes in the drive
594 * by invalidating the corresponding AGID'. As long as we haven't got
595 * an AGID, invalidate one (in sequence) and try again. */
596 for( i = 0; i_ret == -1 && i < 4 ; ++i )
598 print_debug( dvdcss, "ioctl ReportAgid failed, "
599 "invalidating AGID %d", i );
601 /* This is really _not good_, should be handled by the OS.
602 * Invalidating an AGID could make another process fail somewhere
603 * in its authentication process. */
604 dvdcss->css.i_agid = i;
605 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
607 print_debug( dvdcss, "requesting AGID" );
608 i_ret = ioctl_ReportAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
611 /* Unable to authenticate without AGID */
612 if( i_ret == -1 )
614 print_error( dvdcss, "ioctl ReportAgid failed, fatal" );
615 return -1;
618 /* Setup a challenge, any values should work */
619 for( i = 0 ; i < 10; ++i )
621 p_challenge[i] = i;
624 /* Get challenge from host */
625 for( i = 0 ; i < 10 ; ++i )
627 p_buffer[9-i] = p_challenge[i];
630 /* Send challenge to LU */
631 if( ioctl_SendChallenge( dvdcss->i_fd,
632 &dvdcss->css.i_agid, p_buffer ) < 0 )
634 print_error( dvdcss, "ioctl SendChallenge failed" );
635 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
636 return -1;
639 /* Get key1 from LU */
640 if( ioctl_ReportKey1( dvdcss->i_fd, &dvdcss->css.i_agid, p_buffer ) < 0)
642 print_error( dvdcss, "ioctl ReportKey1 failed" );
643 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
644 return -1;
647 /* Send key1 to host */
648 for( i = 0 ; i < KEY_SIZE ; i++ )
650 p_key1[i] = p_buffer[4-i];
653 for( i = 0 ; i < 32 ; ++i )
655 CryptKey( 0, i, p_challenge, p_key_check );
657 if( memcmp( p_key_check, p_key1, KEY_SIZE ) == 0 )
659 print_debug( dvdcss, "drive authenticated, using variant %d", i );
660 i_variant = i;
661 break;
665 if( i == 32 )
667 print_error( dvdcss, "drive would not authenticate" );
668 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
669 return -1;
672 /* Get challenge from LU */
673 if( ioctl_ReportChallenge( dvdcss->i_fd,
674 &dvdcss->css.i_agid, p_buffer ) < 0 )
676 print_error( dvdcss, "ioctl ReportKeyChallenge failed" );
677 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
678 return -1;
681 /* Send challenge to host */
682 for( i = 0 ; i < 10 ; ++i )
684 p_challenge[i] = p_buffer[9-i];
687 CryptKey( 1, i_variant, p_challenge, p_key2 );
689 /* Get key2 from host */
690 for( i = 0 ; i < KEY_SIZE ; ++i )
692 p_buffer[4-i] = p_key2[i];
695 /* Send key2 to LU */
696 if( ioctl_SendKey2( dvdcss->i_fd, &dvdcss->css.i_agid, p_buffer ) < 0 )
698 print_error( dvdcss, "ioctl SendKey2 failed" );
699 ioctl_InvalidateAgid( dvdcss->i_fd, &dvdcss->css.i_agid );
700 return -1;
703 /* The drive has accepted us as authentic. */
704 print_debug( dvdcss, "authentication established" );
706 memcpy( p_challenge, p_key1, KEY_SIZE );
707 memcpy( p_challenge + KEY_SIZE, p_key2, KEY_SIZE );
709 CryptKey( 2, i_variant, p_challenge, dvdcss->css.p_bus_key );
711 return 0;
714 /*****************************************************************************
715 * PrintKey : debug function that dumps a key value
716 *****************************************************************************/
717 static void PrintKey( dvdcss_t dvdcss, char *prefix, uint8_t const *data )
719 print_debug( dvdcss, "%s%02x:%02x:%02x:%02x:%02x", prefix,
720 data[0], data[1], data[2], data[3], data[4] );
723 /*****************************************************************************
724 * GetASF : Get Authentication success flag
725 *****************************************************************************
726 * Returns :
727 * -1 on ioctl error,
728 * 0 if the device needs to be authenticated,
729 * 1 either.
730 *****************************************************************************/
731 static int GetASF( dvdcss_t dvdcss )
733 int i_asf = 0;
735 if( ioctl_ReportASF( dvdcss->i_fd, NULL, &i_asf ) != 0 )
737 /* The ioctl process has failed */
738 print_error( dvdcss, "GetASF fatal error" );
739 return -1;
742 if( i_asf )
744 print_debug( dvdcss, "GetASF authenticated, ASF=1" );
746 else
748 print_debug( dvdcss, "GetASF not authenticated, ASF=0" );
751 return i_asf;
754 /*****************************************************************************
755 * CryptKey : shuffles bits and unencrypt keys.
756 *****************************************************************************
757 * Used during authentication and disc key negociation in GetBusKey.
758 * i_key_type : 0->key1, 1->key2, 2->buskey.
759 * i_variant : between 0 and 31.
760 *****************************************************************************/
761 static void CryptKey( int i_key_type, int i_variant,
762 uint8_t const *p_challenge, uint8_t *p_key )
764 /* Permutation table for challenge */
765 uint8_t pp_perm_challenge[3][10] =
766 { { 1, 3, 0, 7, 5, 2, 9, 6, 4, 8 },
767 { 6, 1, 9, 3, 8, 5, 7, 4, 0, 2 },
768 { 4, 0, 3, 5, 7, 2, 8, 6, 1, 9 } };
770 /* Permutation table for variant table for key2 and buskey */
771 uint8_t pp_perm_variant[2][32] =
772 { { 0x0a, 0x08, 0x0e, 0x0c, 0x0b, 0x09, 0x0f, 0x0d,
773 0x1a, 0x18, 0x1e, 0x1c, 0x1b, 0x19, 0x1f, 0x1d,
774 0x02, 0x00, 0x06, 0x04, 0x03, 0x01, 0x07, 0x05,
775 0x12, 0x10, 0x16, 0x14, 0x13, 0x11, 0x17, 0x15 },
776 { 0x12, 0x1a, 0x16, 0x1e, 0x02, 0x0a, 0x06, 0x0e,
777 0x10, 0x18, 0x14, 0x1c, 0x00, 0x08, 0x04, 0x0c,
778 0x13, 0x1b, 0x17, 0x1f, 0x03, 0x0b, 0x07, 0x0f,
779 0x11, 0x19, 0x15, 0x1d, 0x01, 0x09, 0x05, 0x0d } };
781 uint8_t p_variants[32] =
782 { 0xB7, 0x74, 0x85, 0xD0, 0xCC, 0xDB, 0xCA, 0x73,
783 0x03, 0xFE, 0x31, 0x03, 0x52, 0xE0, 0xB7, 0x42,
784 0x63, 0x16, 0xF2, 0x2A, 0x79, 0x52, 0xFF, 0x1B,
785 0x7A, 0x11, 0xCA, 0x1A, 0x9B, 0x40, 0xAD, 0x01 };
787 /* The "secret" key */
788 uint8_t p_secret[5] = { 0x55, 0xD6, 0xC4, 0xC5, 0x28 };
790 uint8_t p_bits[30], p_scratch[10], p_tmp1[5], p_tmp2[5];
791 uint8_t i_lfsr0_o; /* 1 bit used */
792 uint8_t i_lfsr1_o; /* 1 bit used */
793 uint8_t i_css_variant, i_cse, i_index, i_combined, i_carry;
794 uint8_t i_val = 0;
795 uint32_t i_lfsr0, i_lfsr1;
796 int i_term = 0;
797 int i_bit;
798 int i;
800 for (i = 9; i >= 0; --i)
801 p_scratch[i] = p_challenge[pp_perm_challenge[i_key_type][i]];
803 i_css_variant = ( i_key_type == 0 ) ? i_variant :
804 pp_perm_variant[i_key_type-1][i_variant];
807 * This encryption engine implements one of 32 variations
808 * one the same theme depending upon the choice in the
809 * variant parameter (0 - 31).
811 * The algorithm itself manipulates a 40 bit input into
812 * a 40 bit output.
813 * The parameter 'input' is 80 bits. It consists of
814 * the 40 bit input value that is to be encrypted followed
815 * by a 40 bit seed value for the pseudo random number
816 * generators.
819 /* Feed the secret into the input values such that
820 * we alter the seed to the LFSR's used above, then
821 * generate the bits to play with.
823 for( i = 5 ; --i >= 0 ; )
825 p_tmp1[i] = p_scratch[5 + i] ^ p_secret[i] ^ p_crypt_tab2[i];
829 * We use two LFSR's (seeded from some of the input data bytes) to
830 * generate two streams of pseudo-random bits. These two bit streams
831 * are then combined by simply adding with carry to generate a final
832 * sequence of pseudo-random bits which is stored in the buffer that
833 * 'output' points to the end of - len is the size of this buffer.
835 * The first LFSR is of degree 25, and has a polynomial of:
836 * x^13 + x^5 + x^4 + x^1 + 1
838 * The second LSFR is of degree 17, and has a (primitive) polynomial of:
839 * x^15 + x^1 + 1
841 * I don't know if these polynomials are primitive modulo 2, and thus
842 * represent maximal-period LFSR's.
845 * Note that we take the output of each LFSR from the new shifted in
846 * bit, not the old shifted out bit. Thus for ease of use the LFSR's
847 * are implemented in bit reversed order.
851 /* In order to ensure that the LFSR works we need to ensure that the
852 * initial values are non-zero. Thus when we initialise them from
853 * the seed, we ensure that a bit is set.
855 i_lfsr0 = ( p_tmp1[0] << 17 ) | ( p_tmp1[1] << 9 ) |
856 (( p_tmp1[2] & ~7 ) << 1 ) | 8 | ( p_tmp1[2] & 7 );
857 i_lfsr1 = ( p_tmp1[3] << 9 ) | 0x100 | p_tmp1[4];
859 i_index = sizeof(p_bits);
860 i_carry = 0;
864 for( i_bit = 0, i_val = 0 ; i_bit < 8 ; ++i_bit )
867 i_lfsr0_o = ( ( i_lfsr0 >> 24 ) ^ ( i_lfsr0 >> 21 ) ^
868 ( i_lfsr0 >> 20 ) ^ ( i_lfsr0 >> 12 ) ) & 1;
869 i_lfsr0 = ( i_lfsr0 << 1 ) | i_lfsr0_o;
871 i_lfsr1_o = ( ( i_lfsr1 >> 16 ) ^ ( i_lfsr1 >> 2 ) ) & 1;
872 i_lfsr1 = ( i_lfsr1 << 1 ) | i_lfsr1_o;
874 i_combined = !i_lfsr1_o + i_carry + !i_lfsr0_o;
875 /* taking bit 1 */
876 i_carry = ( i_combined >> 1 ) & 1;
877 i_val |= ( i_combined & 1 ) << i_bit;
880 p_bits[--i_index] = i_val;
881 } while( i_index > 0 );
883 /* This term is used throughout the following to
884 * select one of 32 different variations on the
885 * algorithm.
887 i_cse = p_variants[i_css_variant] ^ p_crypt_tab2[i_css_variant];
889 /* Now the actual blocks doing the encryption. Each
890 * of these works on 40 bits at a time and are quite
891 * similar.
893 i_index = 0;
894 for( i = 5, i_term = 0 ; --i >= 0 ; i_term = p_scratch[i] )
896 i_index = p_bits[25 + i] ^ p_scratch[i];
897 i_index = p_crypt_tab1[i_index] ^ ~p_crypt_tab2[i_index] ^ i_cse;
899 p_tmp1[i] = p_crypt_tab2[i_index] ^ p_crypt_tab3[i_index] ^ i_term;
901 p_tmp1[4] ^= p_tmp1[0];
903 for( i = 5, i_term = 0 ; --i >= 0 ; i_term = p_tmp1[i] )
905 i_index = p_bits[20 + i] ^ p_tmp1[i];
906 i_index = p_crypt_tab1[i_index] ^ ~p_crypt_tab2[i_index] ^ i_cse;
908 p_tmp2[i] = p_crypt_tab2[i_index] ^ p_crypt_tab3[i_index] ^ i_term;
910 p_tmp2[4] ^= p_tmp2[0];
912 for( i = 5, i_term = 0 ; --i >= 0 ; i_term = p_tmp2[i] )
914 i_index = p_bits[15 + i] ^ p_tmp2[i];
915 i_index = p_crypt_tab1[i_index] ^ ~p_crypt_tab2[i_index] ^ i_cse;
916 i_index = p_crypt_tab2[i_index] ^ p_crypt_tab3[i_index] ^ i_term;
918 p_tmp1[i] = p_crypt_tab0[i_index] ^ p_crypt_tab2[i_index];
920 p_tmp1[4] ^= p_tmp1[0];
922 for( i = 5, i_term = 0 ; --i >= 0 ; i_term = p_tmp1[i] )
924 i_index = p_bits[10 + i] ^ p_tmp1[i];
925 i_index = p_crypt_tab1[i_index] ^ ~p_crypt_tab2[i_index] ^ i_cse;
927 i_index = p_crypt_tab2[i_index] ^ p_crypt_tab3[i_index] ^ i_term;
929 p_tmp2[i] = p_crypt_tab0[i_index] ^ p_crypt_tab2[i_index];
931 p_tmp2[4] ^= p_tmp2[0];
933 for( i = 5, i_term = 0 ; --i >= 0 ; i_term = p_tmp2[i] )
935 i_index = p_bits[5 + i] ^ p_tmp2[i];
936 i_index = p_crypt_tab1[i_index] ^ ~p_crypt_tab2[i_index] ^ i_cse;
938 p_tmp1[i] = p_crypt_tab2[i_index] ^ p_crypt_tab3[i_index] ^ i_term;
940 p_tmp1[4] ^= p_tmp1[0];
942 for(i = 5, i_term = 0 ; --i >= 0 ; i_term = p_tmp1[i] )
944 i_index = p_bits[i] ^ p_tmp1[i];
945 i_index = p_crypt_tab1[i_index] ^ ~p_crypt_tab2[i_index] ^ i_cse;
947 p_key[i] = p_crypt_tab2[i_index] ^ p_crypt_tab3[i_index] ^ i_term;
950 return;
953 /*****************************************************************************
954 * DecryptKey: decrypt p_crypted with p_key.
955 *****************************************************************************
956 * Used to decrypt the disc key, with a player key, after requesting it
957 * in _dvdcss_disckey and to decrypt title keys, with a disc key, requested
958 * in _dvdcss_titlekey.
959 * The player keys and the resulting disc key are only used as KEKs
960 * (key encryption keys).
961 * Decryption is slightly dependant on the type of key:
962 * -for disc key, invert is 0x00,
963 * -for title key, invert if 0xff.
964 *****************************************************************************/
965 static void DecryptKey( uint8_t invert, uint8_t const *p_key,
966 uint8_t const *p_crypted, uint8_t *p_result )
968 unsigned int i_lfsr1_lo;
969 unsigned int i_lfsr1_hi;
970 unsigned int i_lfsr0;
971 unsigned int i_combined;
972 uint8_t o_lfsr0;
973 uint8_t o_lfsr1;
974 uint8_t k[5];
975 int i;
977 i_lfsr1_lo = p_key[0] | 0x100;
978 i_lfsr1_hi = p_key[1];
980 i_lfsr0 = ( ( p_key[4] << 17 )
981 | ( p_key[3] << 9 )
982 | ( p_key[2] << 1 ) )
983 + 8 - ( p_key[2] & 7 );
984 i_lfsr0 = ( p_css_tab4[i_lfsr0 & 0xff] << 24 ) |
985 ( p_css_tab4[( i_lfsr0 >> 8 ) & 0xff] << 16 ) |
986 ( p_css_tab4[( i_lfsr0 >> 16 ) & 0xff] << 8 ) |
987 p_css_tab4[( i_lfsr0 >> 24 ) & 0xff];
989 i_combined = 0;
990 for( i = 0 ; i < KEY_SIZE ; ++i )
992 o_lfsr1 = p_css_tab2[i_lfsr1_hi] ^ p_css_tab3[i_lfsr1_lo];
993 i_lfsr1_hi = i_lfsr1_lo >> 1;
994 i_lfsr1_lo = ( ( i_lfsr1_lo & 1 ) << 8 ) ^ o_lfsr1;
995 o_lfsr1 = p_css_tab4[o_lfsr1];
997 o_lfsr0 = ((((((( i_lfsr0 >> 8 ) ^ i_lfsr0 ) >> 1 )
998 ^ i_lfsr0 ) >> 3 ) ^ i_lfsr0 ) >> 7 );
999 i_lfsr0 = ( i_lfsr0 >> 8 ) | ( o_lfsr0 << 24 );
1001 i_combined += ( o_lfsr0 ^ invert ) + o_lfsr1;
1002 k[i] = i_combined & 0xff;
1003 i_combined >>= 8;
1006 p_result[4] = k[4] ^ p_css_tab1[p_crypted[4]] ^ p_crypted[3];
1007 p_result[3] = k[3] ^ p_css_tab1[p_crypted[3]] ^ p_crypted[2];
1008 p_result[2] = k[2] ^ p_css_tab1[p_crypted[2]] ^ p_crypted[1];
1009 p_result[1] = k[1] ^ p_css_tab1[p_crypted[1]] ^ p_crypted[0];
1010 p_result[0] = k[0] ^ p_css_tab1[p_crypted[0]] ^ p_result[4];
1012 p_result[4] = k[4] ^ p_css_tab1[p_result[4]] ^ p_result[3];
1013 p_result[3] = k[3] ^ p_css_tab1[p_result[3]] ^ p_result[2];
1014 p_result[2] = k[2] ^ p_css_tab1[p_result[2]] ^ p_result[1];
1015 p_result[1] = k[1] ^ p_css_tab1[p_result[1]] ^ p_result[0];
1016 p_result[0] = k[0] ^ p_css_tab1[p_result[0]];
1018 return;
1021 /*****************************************************************************
1022 * player_keys: alternate DVD player keys
1023 *****************************************************************************
1024 * These player keys were generated using Frank A. Stevenson's PlayerKey
1025 * cracker. A copy of his article can be found here:
1026 * http://www-2.cs.cmu.edu/~dst/DeCSS/FrankStevenson/mail2.txt
1027 *****************************************************************************/
1028 static const dvd_key_t player_keys[] =
1030 { 0x01, 0xaf, 0xe3, 0x12, 0x80 },
1031 { 0x12, 0x11, 0xca, 0x04, 0x3b },
1032 { 0x14, 0x0c, 0x9e, 0xd0, 0x09 },
1033 { 0x14, 0x71, 0x35, 0xba, 0xe2 },
1034 { 0x1a, 0xa4, 0x33, 0x21, 0xa6 },
1035 { 0x26, 0xec, 0xc4, 0xa7, 0x4e },
1036 { 0x2c, 0xb2, 0xc1, 0x09, 0xee },
1037 { 0x2f, 0x25, 0x9e, 0x96, 0xdd },
1038 { 0x33, 0x2f, 0x49, 0x6c, 0xe0 },
1039 { 0x35, 0x5b, 0xc1, 0x31, 0x0f },
1040 { 0x36, 0x67, 0xb2, 0xe3, 0x85 },
1041 { 0x39, 0x3d, 0xf1, 0xf1, 0xbd },
1042 { 0x3b, 0x31, 0x34, 0x0d, 0x91 },
1043 { 0x45, 0xed, 0x28, 0xeb, 0xd3 },
1044 { 0x48, 0xb7, 0x6c, 0xce, 0x69 },
1045 { 0x4b, 0x65, 0x0d, 0xc1, 0xee },
1046 { 0x4c, 0xbb, 0xf5, 0x5b, 0x23 },
1047 { 0x51, 0x67, 0x67, 0xc5, 0xe0 },
1048 { 0x53, 0x94, 0xe1, 0x75, 0xbf },
1049 { 0x57, 0x2c, 0x8b, 0x31, 0xae },
1050 { 0x63, 0xdb, 0x4c, 0x5b, 0x4a },
1051 { 0x7b, 0x1e, 0x5e, 0x2b, 0x57 },
1052 { 0x85, 0xf3, 0x85, 0xa0, 0xe0 },
1053 { 0xab, 0x1e, 0xe7, 0x7b, 0x72 },
1054 { 0xab, 0x36, 0xe3, 0xeb, 0x76 },
1055 { 0xb1, 0xb8, 0xf9, 0x38, 0x03 },
1056 { 0xb8, 0x5d, 0xd8, 0x53, 0xbd },
1057 { 0xbf, 0x92, 0xc3, 0xb0, 0xe2 },
1058 { 0xcf, 0x1a, 0xb2, 0xf8, 0x0a },
1059 { 0xec, 0xa0, 0xcf, 0xb3, 0xff },
1060 { 0xfc, 0x95, 0xa9, 0x87, 0x35 }
1063 /*****************************************************************************
1064 * DecryptDiscKey
1065 *****************************************************************************
1066 * Decryption of the disc key with player keys: try to decrypt the disc key
1067 * from every position with every player key.
1068 * p_struct_disckey: the 2048 byte DVD_STRUCT_DISCKEY data
1069 * p_disc_key: result, the 5 byte disc key
1070 *****************************************************************************/
1071 static int DecryptDiscKey( dvdcss_t dvdcss, uint8_t const *p_struct_disckey,
1072 dvd_key_t p_disc_key )
1074 uint8_t p_verify[KEY_SIZE];
1075 unsigned int i, n = 0;
1077 /* Decrypt disc key with the above player keys */
1078 for( n = 0; n < sizeof(player_keys) / sizeof(dvd_key_t); n++ )
1080 PrintKey( dvdcss, "trying player key ", player_keys[n] );
1082 for( i = 1; i < 409; i++ )
1084 /* Check if player key n is the right key for position i. */
1085 DecryptKey( 0, player_keys[n], p_struct_disckey + 5 * i,
1086 p_disc_key );
1088 /* The first part in the struct_disckey block is the
1089 * 'disc key' encrypted with itself. Using this we
1090 * can check if we decrypted the correct key. */
1091 DecryptKey( 0, p_disc_key, p_struct_disckey, p_verify );
1093 /* If the position / player key pair worked then return. */
1094 if( memcmp( p_disc_key, p_verify, KEY_SIZE ) == 0 )
1096 return 0;
1101 /* Have tried all combinations of positions and keys,
1102 * and we still didn't succeed. */
1103 memset( p_disc_key, 0, KEY_SIZE );
1104 return -1;
1107 /*****************************************************************************
1108 * DecryptTitleKey
1109 *****************************************************************************
1110 * Decrypt the title key using the disc key.
1111 * p_disc_key: result, the 5 byte disc key
1112 * p_titlekey: the encrypted title key, gets overwritten by the decrypted key
1113 *****************************************************************************/
1114 static void DecryptTitleKey( dvd_key_t p_disc_key, dvd_key_t p_titlekey )
1116 DecryptKey( 0xff, p_disc_key, p_titlekey, p_titlekey );
1119 /*****************************************************************************
1120 * CrackDiscKey: brute force disc key
1121 * CSS hash reversal function designed by Frank Stevenson
1122 *****************************************************************************
1123 * This function uses a big amount of memory to crack the disc key from the
1124 * disc key hash, if player keys are not available.
1125 *****************************************************************************/
1126 #define K1TABLEWIDTH 10
1129 * Simple function to test if a candidate key produces the given hash
1131 static int investigate( unsigned char *hash, unsigned char *ckey )
1133 unsigned char key[KEY_SIZE];
1135 DecryptKey( 0, ckey, hash, key );
1137 return memcmp( key, ckey, KEY_SIZE );
1140 static int CrackDiscKey( dvdcss_t dvdcss, uint8_t *p_disc_key )
1142 unsigned char B[5] = { 0,0,0,0,0 }; /* Second Stage of mangle cipher */
1143 unsigned char C[5] = { 0,0,0,0,0 }; /* Output Stage of mangle cipher
1144 * IntermediateKey */
1145 unsigned char k[5] = { 0,0,0,0,0 }; /* Mangling cipher key
1146 * Also output from CSS( C ) */
1147 unsigned char out1[5]; /* five first output bytes of LFSR1 */
1148 unsigned char out2[5]; /* five first output bytes of LFSR2 */
1149 unsigned int lfsr1a; /* upper 9 bits of LFSR1 */
1150 unsigned int lfsr1b; /* lower 8 bits of LFSR1 */
1151 unsigned int tmp, tmp2, tmp3, tmp4,tmp5;
1152 int i,j;
1153 unsigned int nStepA; /* iterator for LFSR1 start state */
1154 unsigned int nStepB; /* iterator for possible B[0] */
1155 unsigned int nTry; /* iterator for K[1] possibilities */
1156 unsigned int nPossibleK1; /* #of possible K[1] values */
1157 unsigned char* K1table; /* Lookup table for possible K[1] */
1158 unsigned int* BigTable; /* LFSR2 startstate indexed by
1159 * 1,2,5 output byte */
1162 * Prepare tables for hash reversal
1165 /* initialize lookup tables for k[1] */
1166 K1table = malloc( 65536 * K1TABLEWIDTH );
1167 memset( K1table, 0 , 65536 * K1TABLEWIDTH );
1168 if( K1table == NULL )
1170 return -1;
1173 tmp = p_disc_key[0] ^ p_css_tab1[ p_disc_key[1] ];
1174 for( i = 0 ; i < 256 ; i++ ) /* k[1] */
1176 tmp2 = p_css_tab1[ tmp ^ i ]; /* p_css_tab1[ B[1] ]*/
1178 for( j = 0 ; j < 256 ; j++ ) /* B[0] */
1180 tmp3 = j ^ tmp2 ^ i; /* C[1] */
1181 tmp4 = K1table[ K1TABLEWIDTH * ( 256 * j + tmp3 ) ]; /* count of entries here */
1182 tmp4++;
1184 if( tmp4 == K1TABLEWIDTH )
1186 print_debug( dvdcss, "Table disaster %d", tmp4 );
1189 if( tmp4 < K1TABLEWIDTH )
1191 K1table[ K1TABLEWIDTH * ( 256 * j + tmp3 ) + tmp4 ] = i;
1193 K1table[ K1TABLEWIDTH * ( 256 * j + tmp3 ) ] = tmp4;
1197 /* Initing our Really big table */
1198 BigTable = malloc( 16777216 * sizeof(int) );
1199 memset( BigTable, 0 , 16777216 * sizeof(int) );
1200 if( BigTable == NULL )
1202 return -1;
1205 tmp3 = 0;
1207 print_debug( dvdcss, "initializing the big table" );
1209 for( i = 0 ; i < 16777216 ; i++ )
1211 tmp = (( i + i ) & 0x1fffff0 ) | 0x8 | ( i & 0x7 );
1213 for( j = 0 ; j < 5 ; j++ )
1215 tmp2=((((((( tmp >> 3 ) ^ tmp ) >> 1 ) ^ tmp ) >> 8 )
1216 ^ tmp ) >> 5 ) & 0xff;
1217 tmp = ( tmp << 8) | tmp2;
1218 out2[j] = p_css_tab4[ tmp2 ];
1221 j = ( out2[0] << 16 ) | ( out2[1] << 8 ) | out2[4];
1222 BigTable[j] = i;
1226 * We are done initing, now reverse hash
1228 tmp5 = p_disc_key[0] ^ p_css_tab1[ p_disc_key[1] ];
1230 for( nStepA = 0 ; nStepA < 65536 ; nStepA ++ )
1232 lfsr1a = 0x100 | ( nStepA >> 8 );
1233 lfsr1b = nStepA & 0xff;
1235 /* Generate 5 first output bytes from lfsr1 */
1236 for( i = 0 ; i < 5 ; i++ )
1238 tmp = p_css_tab2[ lfsr1b ] ^ p_css_tab3[ lfsr1a ];
1239 lfsr1b = lfsr1a >> 1;
1240 lfsr1a = ((lfsr1a&1)<<8) ^ tmp;
1241 out1[ i ] = p_css_tab4[ tmp ];
1244 /* cumpute and cache some variables */
1245 C[0] = nStepA >> 8;
1246 C[1] = nStepA & 0xff;
1247 tmp = p_disc_key[3] ^ p_css_tab1[ p_disc_key[4] ];
1248 tmp2 = p_css_tab1[ p_disc_key[0] ];
1250 /* Search through all possible B[0] */
1251 for( nStepB = 0 ; nStepB < 256 ; nStepB++ )
1253 /* reverse parts of the mangling cipher */
1254 B[0] = nStepB;
1255 k[0] = p_css_tab1[ B[0] ] ^ C[0];
1256 B[4] = B[0] ^ k[0] ^ tmp2;
1257 k[4] = B[4] ^ tmp;
1258 nPossibleK1 = K1table[ K1TABLEWIDTH * (256 * B[0] + C[1]) ];
1260 /* Try out all possible values for k[1] */
1261 for( nTry = 0 ; nTry < nPossibleK1 ; nTry++ )
1263 k[1] = K1table[ K1TABLEWIDTH * (256 * B[0] + C[1]) + nTry + 1 ];
1264 B[1] = tmp5 ^ k[1];
1266 /* reconstruct output from LFSR2 */
1267 tmp3 = ( 0x100 + k[0] - out1[0] );
1268 out2[0] = tmp3 & 0xff;
1269 tmp3 = tmp3 & 0x100 ? 0x100 : 0xff;
1270 tmp3 = ( tmp3 + k[1] - out1[1] );
1271 out2[1] = tmp3 & 0xff;
1272 tmp3 = ( 0x100 + k[4] - out1[4] );
1273 out2[4] = tmp3 & 0xff; /* Can be 1 off */
1275 /* test first possible out2[4] */
1276 tmp4 = ( out2[0] << 16 ) | ( out2[1] << 8 ) | out2[4];
1277 tmp4 = BigTable[ tmp4 ];
1278 C[2] = tmp4 & 0xff;
1279 C[3] = ( tmp4 >> 8 ) & 0xff;
1280 C[4] = ( tmp4 >> 16 ) & 0xff;
1281 B[3] = p_css_tab1[ B[4] ] ^ k[4] ^ C[4];
1282 k[3] = p_disc_key[2] ^ p_css_tab1[ p_disc_key[3] ] ^ B[3];
1283 B[2] = p_css_tab1[ B[3] ] ^ k[3] ^ C[3];
1284 k[2] = p_disc_key[1] ^ p_css_tab1[ p_disc_key[2] ] ^ B[2];
1286 if( ( B[1] ^ p_css_tab1[ B[2] ] ^ k[ 2 ] ) == C[ 2 ] )
1288 if( ! investigate( &p_disc_key[0] , &C[0] ) )
1290 goto end;
1294 /* Test second possible out2[4] */
1295 out2[4] = ( out2[4] + 0xff ) & 0xff;
1296 tmp4 = ( out2[0] << 16 ) | ( out2[1] << 8 ) | out2[4];
1297 tmp4 = BigTable[ tmp4 ];
1298 C[2] = tmp4 & 0xff;
1299 C[3] = ( tmp4 >> 8 ) & 0xff;
1300 C[4] = ( tmp4 >> 16 ) & 0xff;
1301 B[3] = p_css_tab1[ B[4] ] ^ k[4] ^ C[4];
1302 k[3] = p_disc_key[2] ^ p_css_tab1[ p_disc_key[3] ] ^ B[3];
1303 B[2] = p_css_tab1[ B[3] ] ^ k[3] ^ C[3];
1304 k[2] = p_disc_key[1] ^ p_css_tab1[ p_disc_key[2] ] ^ B[2];
1306 if( ( B[1] ^ p_css_tab1[ B[2] ] ^ k[ 2 ] ) == C[ 2 ] )
1308 if( ! investigate( &p_disc_key[0] , &C[0] ) )
1310 goto end;
1317 end:
1319 memcpy( p_disc_key, &C[0], KEY_SIZE );
1321 free( K1table );
1322 free( BigTable );
1324 return 0;
1327 /*****************************************************************************
1328 * RecoverTitleKey: (title) key recovery from cipher and plain text
1329 * Function designed by Frank Stevenson
1330 *****************************************************************************
1331 * Called from Attack* which are in turn called by CrackTitleKey. Given
1332 * a guessed(?) plain text and the cipher text. Returns -1 on failure.
1333 *****************************************************************************/
1334 static int RecoverTitleKey( int i_start, uint8_t const *p_crypted,
1335 uint8_t const *p_decrypted,
1336 uint8_t const *p_sector_seed, uint8_t *p_key )
1338 uint8_t p_buffer[10];
1339 unsigned int i_t1, i_t2, i_t3, i_t4, i_t5, i_t6;
1340 unsigned int i_try;
1341 unsigned int i_candidate;
1342 unsigned int i, j;
1343 int i_exit = -1;
1345 for( i = 0 ; i < 10 ; i++ )
1347 p_buffer[i] = p_css_tab1[p_crypted[i]] ^ p_decrypted[i];
1350 for( i_try = i_start ; i_try < 0x10000 ; i_try++ )
1352 i_t1 = i_try >> 8 | 0x100;
1353 i_t2 = i_try & 0xff;
1354 i_t3 = 0; /* not needed */
1355 i_t5 = 0;
1357 /* iterate cipher 4 times to reconstruct LFSR2 */
1358 for( i = 0 ; i < 4 ; i++ )
1360 /* advance LFSR1 normaly */
1361 i_t4 = p_css_tab2[i_t2] ^ p_css_tab3[i_t1];
1362 i_t2 = i_t1 >> 1;
1363 i_t1 = ( ( i_t1 & 1 ) << 8 ) ^ i_t4;
1364 i_t4 = p_css_tab5[i_t4];
1365 /* deduce i_t6 & i_t5 */
1366 i_t6 = p_buffer[i];
1367 if( i_t5 )
1369 i_t6 = ( i_t6 + 0xff ) & 0x0ff;
1371 if( i_t6 < i_t4 )
1373 i_t6 += 0x100;
1375 i_t6 -= i_t4;
1376 i_t5 += i_t6 + i_t4;
1377 i_t6 = p_css_tab4[ i_t6 ];
1378 /* feed / advance i_t3 / i_t5 */
1379 i_t3 = ( i_t3 << 8 ) | i_t6;
1380 i_t5 >>= 8;
1383 i_candidate = i_t3;
1385 /* iterate 6 more times to validate candidate key */
1386 for( ; i < 10 ; i++ )
1388 i_t4 = p_css_tab2[i_t2] ^ p_css_tab3[i_t1];
1389 i_t2 = i_t1 >> 1;
1390 i_t1 = ( ( i_t1 & 1 ) << 8 ) ^ i_t4;
1391 i_t4 = p_css_tab5[i_t4];
1392 i_t6 = ((((((( i_t3 >> 3 ) ^ i_t3 ) >> 1 ) ^
1393 i_t3 ) >> 8 ) ^ i_t3 ) >> 5 ) & 0xff;
1394 i_t3 = ( i_t3 << 8 ) | i_t6;
1395 i_t6 = p_css_tab4[i_t6];
1396 i_t5 += i_t6 + i_t4;
1397 if( ( i_t5 & 0xff ) != p_buffer[i] )
1399 break;
1402 i_t5 >>= 8;
1405 if( i == 10 )
1407 /* Do 4 backwards steps of iterating t3 to deduce initial state */
1408 i_t3 = i_candidate;
1409 for( i = 0 ; i < 4 ; i++ )
1411 i_t1 = i_t3 & 0xff;
1412 i_t3 = ( i_t3 >> 8 );
1413 /* easy to code, and fast enough bruteforce
1414 * search for byte shifted in */
1415 for( j = 0 ; j < 256 ; j++ )
1417 i_t3 = ( i_t3 & 0x1ffff ) | ( j << 17 );
1418 i_t6 = ((((((( i_t3 >> 3 ) ^ i_t3 ) >> 1 ) ^
1419 i_t3 ) >> 8 ) ^ i_t3 ) >> 5 ) & 0xff;
1420 if( i_t6 == i_t1 )
1422 break;
1427 i_t4 = ( i_t3 >> 1 ) - 4;
1428 for( i_t5 = 0 ; i_t5 < 8; i_t5++ )
1430 if( ( ( i_t4 + i_t5 ) * 2 + 8 - ( (i_t4 + i_t5 ) & 7 ) )
1431 == i_t3 )
1433 p_key[0] = i_try>>8;
1434 p_key[1] = i_try & 0xFF;
1435 p_key[2] = ( ( i_t4 + i_t5 ) >> 0 ) & 0xFF;
1436 p_key[3] = ( ( i_t4 + i_t5 ) >> 8 ) & 0xFF;
1437 p_key[4] = ( ( i_t4 + i_t5 ) >> 16 ) & 0xFF;
1438 i_exit = i_try + 1;
1444 if( i_exit >= 0 )
1446 p_key[0] ^= p_sector_seed[0];
1447 p_key[1] ^= p_sector_seed[1];
1448 p_key[2] ^= p_sector_seed[2];
1449 p_key[3] ^= p_sector_seed[3];
1450 p_key[4] ^= p_sector_seed[4];
1453 return i_exit;
1457 /******************************************************************************
1458 * Various pieces for the title crack engine.
1459 ******************************************************************************
1460 * The length of the PES packet is located at 0x12-0x13.
1461 * The the copyrigth protection bits are located at 0x14 (bits 0x20 and 0x10).
1462 * The data of the PES packet begins at 0x15 (if there isn't any PTS/DTS)
1463 * or at 0x?? if there are both PTS and DTS's.
1464 * The seed value used with the unscrambling key is the 5 bytes at 0x54-0x58.
1465 * The scrabled part of a sector begins at 0x80.
1466 *****************************************************************************/
1468 /* Statistics */
1469 static int i_tries = 0, i_success = 0;
1471 /*****************************************************************************
1472 * CrackTitleKey: try to crack title key from the contents of a VOB.
1473 *****************************************************************************
1474 * This function is called by _dvdcss_titlekey to find a title key, if we've
1475 * chosen to crack title key instead of decrypting it with the disc key.
1476 * The DVD should have been opened and be in an authenticated state.
1477 * i_pos is the starting sector, i_len is the maximum number of sectors to read
1478 *****************************************************************************/
1479 static int CrackTitleKey( dvdcss_t dvdcss, int i_pos, int i_len,
1480 dvd_key_t p_titlekey )
1482 uint8_t p_buf[ DVDCSS_BLOCK_SIZE ];
1483 const uint8_t p_packstart[4] = { 0x00, 0x00, 0x01, 0xba };
1484 int i_reads = 0;
1485 int i_encrypted = 0;
1486 int b_stop_scanning = 0;
1487 int b_read_error = 0;
1488 int i_ret;
1490 print_debug( dvdcss, "cracking title key at block %i", i_pos );
1492 i_tries = 0;
1493 i_success = 0;
1497 i_ret = dvdcss->pf_seek( dvdcss, i_pos );
1499 if( i_ret != i_pos )
1501 print_error( dvdcss, "seek failed" );
1504 i_ret = dvdcss_read( dvdcss, p_buf, 1, DVDCSS_NOFLAGS );
1506 /* Either we are at the end of the physical device or the auth
1507 * have failed / were not done and we got a read error. */
1508 if( i_ret <= 0 )
1510 if( i_ret == 0 )
1512 print_debug( dvdcss, "read returned 0 (end of device?)" );
1514 else if( !b_read_error )
1516 print_debug( dvdcss, "read error at block %i, resorting to "
1517 "secret arcanes to recover", i_pos );
1519 /* Reset the drive before trying to continue */
1520 _dvdcss_close( dvdcss );
1521 _dvdcss_open( dvdcss );
1523 b_read_error = 1;
1524 continue;
1526 break;
1529 /* Stop when we find a non MPEG stream block.
1530 * (We must have reached the end of the stream).
1531 * For now, allow all blocks that begin with a start code. */
1532 if( memcmp( p_buf, p_packstart, 3 ) )
1534 print_debug( dvdcss, "non MPEG block found at block %i "
1535 "(end of title)", i_pos );
1536 break;
1539 if( p_buf[0x0d] & 0x07 )
1540 print_debug( dvdcss, "stuffing in pack header" );
1542 /* PES_scrambling_control does not exist in a system_header,
1543 * a padding_stream or a private_stream2 (and others?). */
1544 if( p_buf[0x14] & 0x30 && ! ( p_buf[0x11] == 0xbb
1545 || p_buf[0x11] == 0xbe
1546 || p_buf[0x11] == 0xbf ) )
1548 i_encrypted++;
1550 if( AttackPattern(p_buf, i_reads, p_titlekey) > 0 )
1552 b_stop_scanning = 1;
1554 #if 0
1555 if( AttackPadding(p_buf, i_reads, p_titlekey) > 0 )
1557 b_stop_scanning = 1;
1559 #endif
1562 i_pos++;
1563 i_len--;
1564 i_reads++;
1566 /* Emit a progress indication now and then. */
1567 if( !( i_reads & 0xfff ) )
1569 print_debug( dvdcss, "at block %i, still cracking...", i_pos );
1572 /* Stop after 2000 blocks if we haven't seen any encrypted blocks. */
1573 if( i_reads >= 2000 && i_encrypted == 0 ) break;
1575 } while( !b_stop_scanning && i_len > 0);
1577 if( !b_stop_scanning )
1579 print_debug( dvdcss, "end of title reached" );
1582 /* Print some statistics. */
1583 print_debug( dvdcss, "successful attempts %d/%d, scrambled blocks %d/%d",
1584 i_success, i_tries, i_encrypted, i_reads );
1586 if( i_success > 0 /* b_stop_scanning */ )
1588 print_debug( dvdcss, "vts key initialized" );
1589 return 1;
1592 if( i_encrypted == 0 && i_reads > 0 )
1594 memset( p_titlekey, 0, KEY_SIZE );
1595 print_debug( dvdcss, "no scrambled sectors found" );
1596 return 0;
1599 memset( p_titlekey, 0, KEY_SIZE );
1600 return -1;
1604 /******************************************************************************
1605 * The original Ethan Hawke (DeCSSPlus) attack (modified).
1606 ******************************************************************************
1607 * Tries to find a repeating pattern just before the encrypted part starts.
1608 * Then it guesses that the plain text for first encrypted bytes are
1609 * a contiuation of that pattern.
1610 *****************************************************************************/
1611 static int AttackPattern( uint8_t const p_sec[ DVDCSS_BLOCK_SIZE ],
1612 int i_pos, uint8_t *p_key )
1614 unsigned int i_best_plen = 0;
1615 unsigned int i_best_p = 0;
1616 unsigned int i, j;
1618 /* For all cycle length from 2 to 48 */
1619 for( i = 2 ; i < 0x30 ; i++ )
1621 /* Find the number of bytes that repeats in cycles. */
1622 for( j = i + 1;
1623 j < 0x80 && ( p_sec[0x7F - (j%i)] == p_sec[0x7F - j] );
1624 j++ )
1626 /* We have found j repeating bytes with a cycle length i. */
1627 if( j > i_best_plen )
1629 i_best_plen = j;
1630 i_best_p = i;
1635 /* We need at most 10 plain text bytes?, so a make sure that we
1636 * have at least 20 repeated bytes and that they have cycled at
1637 * least one time. */
1638 if( ( i_best_plen > 3 ) && ( i_best_plen / i_best_p >= 2) )
1640 int res;
1642 i_tries++;
1643 memset( p_key, 0, KEY_SIZE );
1644 res = RecoverTitleKey( 0, &p_sec[0x80],
1645 &p_sec[ 0x80 - (i_best_plen / i_best_p) * i_best_p ],
1646 &p_sec[0x54] /* key_seed */, p_key );
1647 i_success += ( res >= 0 );
1648 #if 0
1649 if( res >= 0 )
1651 fprintf( stderr, "key is %02x:%02x:%02x:%02x:%02x ",
1652 p_key[0], p_key[1], p_key[2], p_key[3], p_key[4] );
1653 fprintf( stderr, "at block %5d pattern len %3d period %3d %s\n",
1654 i_pos, i_best_plen, i_best_p, (res>=0?"y":"n") );
1656 #endif
1657 return ( res >= 0 );
1660 return 0;
1664 #if 0
1665 /******************************************************************************
1666 * Encrypted Padding_stream attack.
1667 ******************************************************************************
1668 * DVD specifies that there must only be one type of data in every sector.
1669 * Every sector is one pack and so must obviously be 2048 bytes long.
1670 * For the last pice of video data before a VOBU boundary there might not
1671 * be exactly the right amount of data to fill a sector. Then one has to
1672 * pad the pack to 2048 bytes. For just a few bytes this is done in the
1673 * header but for any large amount you insert a PES packet from the
1674 * Padding stream. This looks like 0x00 00 01 be xx xx ff ff ...
1675 * where xx xx is the length of the padding stream.
1676 *****************************************************************************/
1677 static int AttackPadding( uint8_t const p_sec[ DVDCSS_BLOCK_SIZE ],
1678 int i_pos, uint8_t *p_key )
1680 unsigned int i_pes_length;
1681 /*static int i_tries = 0, i_success = 0;*/
1683 i_pes_length = (p_sec[0x12]<<8) | p_sec[0x13];
1685 /* Coverd by the test below but usfull for debuging. */
1686 if( i_pes_length == DVDCSS_BLOCK_SIZE - 0x14 ) return 0;
1688 /* There must be room for at least 4? bytes of padding stream,
1689 * and it must be encrypted.
1690 * sector size - pack/pes header - padding startcode - padding length */
1691 if( ( DVDCSS_BLOCK_SIZE - 0x14 - 4 - 2 - i_pes_length < 4 ) ||
1692 ( p_sec[0x14 + i_pes_length + 0] == 0x00 &&
1693 p_sec[0x14 + i_pes_length + 1] == 0x00 &&
1694 p_sec[0x14 + i_pes_length + 2] == 0x01 ) )
1696 fprintf( stderr, "plain %d %02x:%02x:%02x:%02x (type %02x sub %02x)\n",
1697 DVDCSS_BLOCK_SIZE - 0x14 - 4 - 2 - i_pes_length,
1698 p_sec[0x14 + i_pes_length + 0],
1699 p_sec[0x14 + i_pes_length + 1],
1700 p_sec[0x14 + i_pes_length + 2],
1701 p_sec[0x14 + i_pes_length + 3],
1702 p_sec[0x11], p_sec[0x17 + p_sec[0x16]]);
1703 return 0;
1706 /* If we are here we know that there is a where in the pack a
1707 encrypted PES header is (startcode + length). It's never more
1708 than two packets in the pack, so we 'know' the length. The
1709 plaintext at offset (0x14 + i_pes_length) will then be
1710 00 00 01 e0/bd/be xx xx, in the case of be the following bytes
1711 are also known. */
1713 /* An encrypted SPU PES packet with another encrypted PES packet following.
1714 Normaly if the following was a padding stream that would be in plain
1715 text. So it will be another SPU PES packet. */
1716 if( p_sec[0x11] == 0xbd &&
1717 p_sec[0x17 + p_sec[0x16]] >= 0x20 &&
1718 p_sec[0x17 + p_sec[0x16]] <= 0x3f )
1720 i_tries++;
1723 /* A Video PES packet with another encrypted PES packet following.
1724 * No reason execpt for time stamps to break the data into two packets.
1725 * So it's likely that the following PES packet is a padding stream. */
1726 if( p_sec[0x11] == 0xe0 )
1728 i_tries++;
1731 if( 1 )
1733 /*fprintf( stderr, "key is %02x:%02x:%02x:%02x:%02x ",
1734 p_key[0], p_key[1], p_key[2], p_key[3], p_key[4] );*/
1735 fprintf( stderr, "at block %5d padding len %4d "
1736 "type %02x sub %02x\n", i_pos, i_pes_length,
1737 p_sec[0x11], p_sec[0x17 + p_sec[0x16]]);
1740 return 0;
1742 #endif