Skip to content

V
vlc-2-2
Commit 0d5eef15 authored by Laurent Aimar's avatar Laurent Aimar
Browse files
Options

- csa.* : CSA scrambling implementation. 

 - demux/ts.c, mux/mpeg/ts.c: added support for CSA (de)scrambling
 (fixed key).
parent e525bf13
Hide whitespace changes
Inline Side-by-side
Showing with 701 additions and 4 deletions
modules/demux/Modules.am
View file @ 0d5eef15
......@@ -14,7 +14,8 @@ SOURCES_livedotcom = livedotcom.cpp
SOURCES_demux2 = demux2.c
SOURCES_nsv = nsv.c
SOURCES_real = real.c
SOURCES_ts2 = ts.c
SOURCES_ts2 = ts.c ../mux/mpeg/csa.c
SOURCES_ps2 = ps.c ps.h
SOURCES_dvdnav = dvdnav.c
SOURCES_mod = mod.c
SOURCES_pva = pva.c
modules/demux/ts.c
View file @ 0d5eef15
......@@ -2,7 +2,7 @@
* ts.c: Transport Stream input module for VLC.
*****************************************************************************
* Copyright (C) 2004 VideoLAN
* $Id: ts.c,v 1.6 2004/01/22 00:02:18 fenrir Exp $
* $Id: ts.c,v 1.7 2004/01/25 02:26:04 fenrir Exp $
*
* Authors: Laurent Aimar <fenrir@via.ecp.fr>
*
......@@ -32,6 +32,8 @@
#include "iso_lang.h"
#include "network.h"
#include "../mux/mpeg/csa.h"
/* Include dvbpsi headers */
#ifdef HAVE_DVBPSI_DR_H
# include <dvbpsi/dvbpsi.h>
......@@ -68,6 +70,7 @@ vlc_module_begin();
add_bool( "ts-es-id-pid", 0, NULL, "set id of es to pid", "set id of es to pid", VLC_TRUE );
add_string( "ts-out", NULL, NULL, "fast udp streaming", "send TS to specific ip:port by udp (you must know what you are doing)", VLC_TRUE );
add_integer( "ts-out-mtu", 1500, NULL, "MTU for out mode", "MTU for out mode", VLC_TRUE );
add_string( "ts-csa-ck", NULL, NULL, "CSA ck", "CSA ck", VLC_TRUE );
set_capability( "demux2", 10 );
set_callbacks( Open, Close );
add_shortcut( "ts2" );
......@@ -208,6 +211,7 @@ struct demux_sys_t
/* */
vlc_bool_t b_es_id_pid;
csa_t *csa;
vlc_bool_t b_udp_out;
int fd; /* udp socket */
......@@ -285,6 +289,7 @@ static int Open( vlc_object_t *p_this )
}
p_sys->b_udp_out = VLC_FALSE;
p_sys->i_ts_read = 50;
p_sys->csa = NULL;
/* Init PAT handler */
pat = &p_sys->pid[0];
......@@ -405,6 +410,42 @@ static int Open( vlc_object_t *p_this )
free( val.psz_string );
}
var_Create( p_demux, "ts-csa-ck", VLC_VAR_STRING | VLC_VAR_DOINHERIT );
var_Get( p_demux, "ts-csa-ck", &val );
if( val.psz_string && *val.psz_string )
{
char *psz = val.psz_string;
if( psz[0] == '0' && ( psz[1] == 'x' || psz[1] == 'X' ) )
{
psz += 2;
}
if( strlen( psz ) != 16 )
{
msg_Warn( p_demux, "invalid csa ck (it must be 16 chars long)" );
}
else
{
uint64_t i_ck = strtoll( psz, NULL, 16 );
uint8_t ck[8];
int i;
for( i = 0; i < 8; i++ )
{
ck[i] = ( i_ck >> ( 56 - 8*i) )&0xff;
}
msg_Dbg( p_demux, "using CSA scrambling with ck=%x:%x:%x:%x:%x:%x:%x:%x",
ck[0], ck[1], ck[2], ck[3], ck[4], ck[5], ck[6], ck[7] );
p_sys->csa = csa_New();
csa_SetCW( p_sys->csa, ck, ck );
}
}
if( val.psz_string )
{
free( val.psz_string );
}
return VLC_SUCCESS;
}
......@@ -461,6 +502,10 @@ static void Close( vlc_object_t *p_this )
net_Close( p_sys->fd );
free( p_sys->buffer );
}
if( p_sys->csa )
{
csa_Delete( p_sys->csa );
}
free( p_sys );
}
......@@ -725,7 +770,7 @@ static void ParsePES ( demux_t *p_demux, ts_pid_t *pid )
if( header[0] != 0 || header[1] != 0 || header[2] != 1 )
{
msg_Err( p_demux, "invalid header [0x%x:%x:%x:%x]", header[0], header[1],header[2],header[3] );
msg_Warn( p_demux, "invalid header [0x%x:%x:%x:%x]", header[0], header[1],header[2],header[3] );
block_ChainRelease( p_pes );
return;
}
......@@ -887,6 +932,11 @@ static vlc_bool_t GatherPES( demux_t *p_demux, ts_pid_t *pid, block_t *p_bk )
msg_Dbg( p_demux, "transport_error_indicator set (pid=0x%x)", pid->i_pid );
}
if( p_demux->p_sys->csa )
{
csa_Decrypt( p_demux->p_sys->csa, p_bk->p_buffer );
}
if( !b_adaptation )
{
i_skip = 4;
......
modules/mux/mpeg/Modules.am
View file @ 0d5eef15
......@@ -6,12 +6,16 @@ SOURCES_mux_ps = ps.c \
SOURCES_mux_ts = ts.c \
pes.c \
pes.h \
csa.c \
csa.h \
bits.h \
$(NULL)
SOURCES_mux_ts_dvbpsi = ts.c \
pes.c \
pes.h \
csa.c \
csa.h \
bits.h \
$(NULL)
modules/mux/mpeg/csa.c 0 → 100644
View file @ 0d5eef15
/*****************************************************************************
* libcsa.c: CSA scrambler/descrambler
*****************************************************************************
* Copyright (C) 2004 Laurent Aimar
* $Id: csa.c,v 1.1 2004/01/25 02:26:04 fenrir Exp $
*
* Authors: Laurent Aimar <fenrir@via.ecp.fr>
*
* 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
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
*****************************************************************************/
/*
* XXX: A great part is just a copy/past of deCSA but I can't find the
* author and the license. If there is a problem with it please e-mail me.
*/
#include <stdlib.h>
#include <vlc/vlc.h>
#include "csa.h"
struct csa_t
{
/* odd and even keys */
uint8_t o_ck[8];
uint8_t e_ck[8];
uint8_t o_kk[57];
uint8_t e_kk[57];
/* cypher state */
int A[11];
int B[11];
int X, Y, Z;
int D, E, F;
int p, q, r;
};
static void csa_ComputeKey( uint8_t kk[57], uint8_t ck[8] );
static void csa_StreamCypher( csa_t *c, int b_init, uint8_t *ck, uint8_t *sb, uint8_t *cb );
static void csa_BlockDecypher( uint8_t kk[57], uint8_t ib[8], uint8_t bd[8] );
static void csa_BlockCypher( uint8_t kk[57], uint8_t bd[8], uint8_t ib[8] );
/*****************************************************************************
* csa_New:
*****************************************************************************/
csa_t *csa_New()
{
csa_t *c = malloc( sizeof( csa_t ) );
memset( c, 0, sizeof( csa_t ) );
return c;
}
/*****************************************************************************
* csa_Delete:
*****************************************************************************/
void csa_Delete( csa_t *c )
{
free( c );
}
/*****************************************************************************
* csa_SetCW:
*****************************************************************************/
void csa_SetCW( csa_t *c, uint8_t o_ck[8], uint8_t e_ck[8] )
{
memcpy( c->o_ck, o_ck, 8 );
csa_ComputeKey( c->o_kk, o_ck );
memcpy( c->e_ck, e_ck, 8 );
csa_ComputeKey( c->e_kk, e_ck );
}
/*****************************************************************************
* csa_Decrypt:
*****************************************************************************/
void csa_Decrypt( csa_t *c, uint8_t *pkt )
{
uint8_t *ck;
uint8_t *kk;
uint8_t ib[8], stream[8], block[8];
int i_hdr, i_residue;
int i, j, n;
/* transport scrambling control */
if( (pkt[3]&0x80) == 0 )
{
/* not scrambled */
return;
}
if( pkt[3]&0x40 )
{
ck = c->o_ck;
kk = c->o_kk;
}
else
{
ck = c->e_ck;
kk = c->e_kk;
}
/* clear transport scrambling control */
pkt[3] &= 0x3f;
i_hdr = 4;
if( pkt[3]&0x20 )
{
/* skip adaption field */
i_hdr += pkt[4] + 1;
}
/* init csa state */
csa_StreamCypher( c, 1, ck, &pkt[i_hdr], ib );
/* */
n = (188 - i_hdr) / 8;
i_residue = (188 - i_hdr) % 8;
for( i = 1; i < n + 1; i++ )
{
csa_BlockDecypher( kk, ib, block );
if( i != n )
{
csa_StreamCypher( c, 0, ck, NULL, stream );
for( j = 0; j < 8; j++ )
{
/* xor ib with stream */
ib[j] = pkt[i_hdr+8*i+j] ^ stream[j];
}
}
else
{
/* last block */
for( j = 0; j < 8; j++ )
{
ib[j] = 0;
}
}
/* xor ib with block */
for( j = 0; j < 8; j++ )
{
pkt[i_hdr+8*(i-1)+j] = ib[j] ^ block[j];
}
}
if( i_residue > 0 )
{
csa_StreamCypher( c, 0, ck, NULL, stream );
for( j = 0; j < i_residue; j++ )
{
pkt[188 - i_residue + j] ^= stream[j];
}
}
}
/*****************************************************************************
* csa_Encrypt:
*****************************************************************************/
void csa_Encrypt( csa_t *c, uint8_t *pkt, int b_odd )
{
uint8_t *ck;
uint8_t *kk;
int i, j;
int i_hdr;
uint8_t ib[184/8+2][8], stream[8], block[8];
int n, i_residue;
/* set transport scrambling control */
pkt[3] |= 0x80;
if( b_odd )
{
pkt[3] |= 0x40;
}
if( b_odd )
{
ck = c->o_ck;
kk = c->o_kk;
}
else
{
ck = c->e_ck;
kk = c->e_kk;
}
/* hdr len */
i_hdr = 4;
if( pkt[3]&0x20 )
{
/* skip adaption field */
i_hdr += pkt[4] + 1;
}
n = (188 - i_hdr) / 8;
i_residue = (188 - i_hdr) % 8;
/* */
for( i = 0; i < 8; i++ )
{
ib[n+1][i] = 0;
}
for( i = n; i > 0; i-- )
{
for( j = 0; j < 8; j++ )
{
block[j] = pkt[i_hdr+8*(i-1)+j] ^ib[i+1][j];
}
csa_BlockCypher( kk, block, ib[i] );
}
/* init csa state */
csa_StreamCypher( c, 1, ck, ib[1], stream );
if( n > 0 )
{
for( i = 0; i < 8; i++ )
{
pkt[i_hdr+i] = ib[1][i];
}
for( i = 2; i < n+1; i++ )
{
csa_StreamCypher( c, 0, ck, NULL, stream );
for( j = 0; j < 8; j++ )
{
pkt[i_hdr+8*(i-1)+j] = ib[i][j] ^ stream[j];
}
}
}
/* FIXME I have no idea if it's correct */
if( i_residue > 0 )
{
csa_StreamCypher( c, 0, ck, NULL, stream );
for( j = 0; j < i_residue; j++ )
{
pkt[188 - i_residue + j] ^= stream[j];
}
}
}
/*****************************************************************************
* Divers
*****************************************************************************/
static const uint8_t key_perm[0x40] =
{
0x12,0x24,0x09,0x07,0x2A,0x31,0x1D,0x15,0x1C,0x36,0x3E,0x32,0x13,0x21,0x3B,0x40,
0x18,0x14,0x25,0x27,0x02,0x35,0x1B,0x01,0x22,0x04,0x0D,0x0E,0x39,0x28,0x1A,0x29,
0x33,0x23,0x34,0x0C,0x16,0x30,0x1E,0x3A,0x2D,0x1F,0x08,0x19,0x17,0x2F,0x3D,0x11,
0x3C,0x05,0x38,0x2B,0x0B,0x06,0x0A,0x2C,0x20,0x3F,0x2E,0x0F,0x03,0x26,0x10,0x37,
};
static void csa_ComputeKey( uint8_t kk[57], uint8_t ck[8] )
{
int i,j,k;
int bit[64];
int newbit[64];
int kb[9][8];
/* from a cw create 56 key bytes, here kk[1..56] */
/* load ck into kb[7][1..8] */
for( i = 0; i < 8; i++ )
{
kb[7][i+1] = ck[i];
}
/* calculate all kb[6..1][*] */
for( i = 0; i < 7; i++ )
{
/* do a 64 bit perm on kb */
for( j = 0; j < 8; j++ )
{
for( k = 0; k < 8; k++ )
{
bit[j*8+k] = (kb[7-i][1+j] >> (7-k)) & 1;
newbit[key_perm[j*8+k]-1] = bit[j*8+k];
}
}
for( j = 0; j < 8; j++ )
{
kb[6-i][1+j] = 0;
for( k = 0; k < 8; k++ )
{
kb[6-i][1+j] |= newbit[j*8+k] << (7-k);
}
}
}
/* xor to give kk */
for( i = 0; i < 7; i++ )
{
for( j = 0; j < 8; j++ )
{
kk[1+i*8+j] = kb[1+i][1+j] ^ i;
}
}
}
static const int sbox1[0x20] = {2,0,1,1,2,3,3,0, 3,2,2,0,1,1,0,3, 0,3,3,0,2,2,1,1, 2,2,0,3,1,1,3,0};
static const int sbox2[0x20] = {3,1,0,2,2,3,3,0, 1,3,2,1,0,0,1,2, 3,1,0,3,3,2,0,2, 0,0,1,2,2,1,3,1};
static const int sbox3[0x20] = {2,0,1,2,2,3,3,1, 1,1,0,3,3,0,2,0, 1,3,0,1,3,0,2,2, 2,0,1,2,0,3,3,1};
static const int sbox4[0x20] = {3,1,2,3,0,2,1,2, 1,2,0,1,3,0,0,3, 1,0,3,1,2,3,0,3, 0,3,2,0,1,2,2,1};
static const int sbox5[0x20] = {2,0,0,1,3,2,3,2, 0,1,3,3,1,0,2,1, 2,3,2,0,0,3,1,1, 1,0,3,2,3,1,0,2};
static const int sbox6[0x20] = {0,1,2,3,1,2,2,0, 0,1,3,0,2,3,1,3, 2,3,0,2,3,0,1,1, 2,1,1,2,0,3,3,0};
static const int sbox7[0x20] = {0,3,2,2,3,0,0,1, 3,0,1,3,1,2,2,1, 1,0,3,3,0,1,1,2, 2,3,1,0,2,3,0,2};
static void csa_StreamCypher( csa_t *c, int b_init, uint8_t *ck, uint8_t *sb, uint8_t *cb )
{
int i,j, k;
int extra_B;
int s1,s2,s3,s4,s5,s6,s7;
int next_A1;
int next_B1;
int next_E;
if( b_init )
{
// load first 32 bits of CK into A[1]..A[8]
// load last 32 bits of CK into B[1]..B[8]
// all other regs = 0
for( i = 0; i < 4; i++ )
{
c->A[1+2*i+0] = ( ck[i] >> 4 )&0x0f;
c->A[1+2*i+1] = ( ck[i] >> 0 )&0x0f;
c->B[1+2*i+0] = ( ck[4+i] >> 4 )&0x0f;
c->B[1+2*i+1] = ( ck[4+i] >> 0 )&0x0f;
}
c->A[9] = c->A[10] = 0;
c->B[9] = c->B[10] = 0;
c->X = c->Y = c->Z = 0;
c->D = c->E = c->F = 0;
c->p = c->q = c->r = 0;
}
// 8 bytes per operation
for( i = 0; i < 8; i++ )
{
int op = 0;
int in1 = 0; /* gcc warn */
int in2 = 0;
if( b_init )
{
in1 = ( sb[i] >> 4 )&0x0f;
in2 = ( sb[i] >> 0 )&0x0f;
}
// 2 bits per iteration
for( j = 0; j < 4; j++ )
{
// from A[1]..A[10], 35 bits are selected as inputs to 7 s-boxes
// 5 bits input per s-box, 2 bits output per s-box
s1 = sbox1[ (((c->A[4]>>0)&1)<<4) | (((c->A[1]>>2)&1)<<3) | (((c->A[6]>>1)&1)<<2) | (((c->A[7]>>3)&1)<<1) | (((c->A[9]>>0)&1)<<0) ];
s2 = sbox2[ (((c->A[2]>>1)&1)<<4) | (((c->A[3]>>2)&1)<<3) | (((c->A[6]>>3)&1)<<2) | (((c->A[7]>>0)&1)<<1) | (((c->A[9]>>1)&1)<<0) ];
s3 = sbox3[ (((c->A[1]>>3)&1)<<4) | (((c->A[2]>>0)&1)<<3) | (((c->A[5]>>1)&1)<<2) | (((c->A[5]>>3)&1)<<1) | (((c->A[6]>>2)&1)<<0) ];
s4 = sbox4[ (((c->A[3]>>3)&1)<<4) | (((c->A[1]>>1)&1)<<3) | (((c->A[2]>>3)&1)<<2) | (((c->A[4]>>2)&1)<<1) | (((c->A[8]>>0)&1)<<0) ];
s5 = sbox5[ (((c->A[5]>>2)&1)<<4) | (((c->A[4]>>3)&1)<<3) | (((c->A[6]>>0)&1)<<2) | (((c->A[8]>>1)&1)<<1) | (((c->A[9]>>2)&1)<<0) ];
s6 = sbox6[ (((c->A[3]>>1)&1)<<4) | (((c->A[4]>>1)&1)<<3) | (((c->A[5]>>0)&1)<<2) | (((c->A[7]>>2)&1)<<1) | (((c->A[9]>>3)&1)<<0) ];
s7 = sbox7[ (((c->A[2]>>2)&1)<<4) | (((c->A[3]>>0)&1)<<3) | (((c->A[7]>>1)&1)<<2) | (((c->A[8]>>2)&1)<<1) | (((c->A[8]>>3)&1)<<0) ];
/* use 4x4 xor to produce extra nibble for T3 */
extra_B = ( ((c->B[3]&1)<<3) ^ ((c->B[6]&2)<<2) ^ ((c->B[7]&4)<<1) ^ ((c->B[9]&8)>>0) ) |
( ((c->B[6]&1)<<2) ^ ((c->B[8]&2)<<1) ^ ((c->B[3]&8)>>1) ^ ((c->B[4]&4)>>0) ) |
( ((c->B[5]&8)>>2) ^ ((c->B[8]&4)>>1) ^ ((c->B[4]&1)<<1) ^ ((c->B[5]&2)>>0) ) |
( ((c->B[9]&4)>>2) ^ ((c->B[6]&8)>>3) ^ ((c->B[3]&2)>>1) ^ ((c->B[8]&1)>>0) ) ;
// T1 = xor all inputs
// in1,in2, D are only used in T1 during initialisation, not generation
next_A1 = c->A[10] ^ c->X;
if( b_init ) next_A1 = next_A1 ^ c->D ^ ((j % 2) ? in2 : in1);
// T2 = xor all inputs
// in1,in2 are only used in T1 during initialisation, not generation
// if p=0, use this, if p=1, rotate the result left
next_B1 = c->B[7] ^ c->B[10] ^ c->Y;
if( b_init) next_B1 = next_B1 ^ ((j % 2) ? in1 : in2);
// if p=1, rotate left
if( c->p ) next_B1 = ( (next_B1 << 1) | ((next_B1 >> 3) & 1) ) & 0xf;
// T3 = xor all inputs
c->D = c->E ^ c->Z ^ extra_B;
// T4 = sum, carry of Z + E + r
next_E = c->F;
if( c->q )
{
c->F = c->Z + c->E + c->r;
// r is the carry
c->r = (c->F >> 4) & 1;
c->F = c->F & 0x0f;
}
else
{
c->F = c->E;
}
c->E = next_E;
for( k = 10; k > 1; k-- )
{
c->A[k] = c->A[k-1];
c->B[k] = c->B[k-1];
}
c->A[1] = next_A1;
c->B[1] = next_B1;
c->X = ((s4&1)<<3) | ((s3&1)<<2) | (s2&2) | ((s1&2)>>1);
c->Y = ((s6&1)<<3) | ((s5&1)<<2) | (s4&2) | ((s3&2)>>1);
c->Z = ((s2&1)<<3) | ((s1&1)<<2) | (s6&2) | ((s5&2)>>1);
c->p = (s7&2)>>1;
c->q = (s7&1);
// require 4 loops per output byte
// 2 output bits are a function of the 4 bits of D
// xor 2 by 2
op = (op << 2)^ ( (((c->D^(c->D>>1))>>1)&2) | ((c->D^(c->D>>1))&1) );
}
// return input data during init
cb[i] = b_init ? sb[i] : op;
}
}
// block - sbox
static const uint8_t block_sbox[256] =
{
0x3A,0xEA,0x68,0xFE,0x33,0xE9,0x88,0x1A,0x83,0xCF,0xE1,0x7F,0xBA,0xE2,0x38,0x12,
0xE8,0x27,0x61,0x95,0x0C,0x36,0xE5,0x70,0xA2,0x06,0x82,0x7C,0x17,0xA3,0x26,0x49,
0xBE,0x7A,0x6D,0x47,0xC1,0x51,0x8F,0xF3,0xCC,0x5B,0x67,0xBD,0xCD,0x18,0x08,0xC9,
0xFF,0x69,0xEF,0x03,0x4E,0x48,0x4A,0x84,0x3F,0xB4,0x10,0x04,0xDC,0xF5,0x5C,0xC6,
0x16,0xAB,0xAC,0x4C,0xF1,0x6A,0x2F,0x3C,0x3B,0xD4,0xD5,0x94,0xD0,0xC4,0x63,0x62,
0x71,0xA1,0xF9,0x4F,0x2E,0xAA,0xC5,0x56,0xE3,0x39,0x93,0xCE,0x65,0x64,0xE4,0x58,
0x6C,0x19,0x42,0x79,0xDD,0xEE,0x96,0xF6,0x8A,0xEC,0x1E,0x85,0x53,0x45,0xDE,0xBB,
0x7E,0x0A,0x9A,0x13,0x2A,0x9D,0xC2,0x5E,0x5A,0x1F,0x32,0x35,0x9C,0xA8,0x73,0x30,
0x29,0x3D,0xE7,0x92,0x87,0x1B,0x2B,0x4B,0xA5,0x57,0x97,0x40,0x15,0xE6,0xBC,0x0E,
0xEB,0xC3,0x34,0x2D,0xB8,0x44,0x25,0xA4,0x1C,0xC7,0x23,0xED,0x90,0x6E,0x50,0x00,
0x99,0x9E,0x4D,0xD9,0xDA,0x8D,0x6F,0x5F,0x3E,0xD7,0x21,0x74,0x86,0xDF,0x6B,0x05,
0x8E,0x5D,0x37,0x11,0xD2,0x28,0x75,0xD6,0xA7,0x77,0x24,0xBF,0xF0,0xB0,0x02,0xB7,
0xF8,0xFC,0x81,0x09,0xB1,0x01,0x76,0x91,0x7D,0x0F,0xC8,0xA0,0xF2,0xCB,0x78,0x60,
0xD1,0xF7,0xE0,0xB5,0x98,0x22,0xB3,0x20,0x1D,0xA6,0xDB,0x7B,0x59,0x9F,0xAE,0x31,
0xFB,0xD3,0xB6,0xCA,0x43,0x72,0x07,0xF4,0xD8,0x41,0x14,0x55,0x0D,0x54,0x8B,0xB9,
0xAD,0x46,0x0B,0xAF,0x80,0x52,0x2C,0xFA,0x8C,0x89,0x66,0xFD,0xB2,0xA9,0x9B,0xC0,
};
// block - perm
static const uint8_t block_perm[256] =
{
0x00,0x02,0x80,0x82,0x20,0x22,0xA0,0xA2, 0x10,0x12,0x90,0x92,0x30,0x32,0xB0,0xB2,
0x04,0x06,0x84,0x86,0x24,0x26,0xA4,0xA6, 0x14,0x16,0x94,0x96,0x34,0x36,0xB4,0xB6,
0x40,0x42,0xC0,0xC2,0x60,0x62,0xE0,0xE2, 0x50,0x52,0xD0,0xD2,0x70,0x72,0xF0,0xF2,
0x44,0x46,0xC4,0xC6,0x64,0x66,0xE4,0xE6, 0x54,0x56,0xD4,0xD6,0x74,0x76,0xF4,0xF6,
0x01,0x03,0x81,0x83,0x21,0x23,0xA1,0xA3, 0x11,0x13,0x91,0x93,0x31,0x33,0xB1,0xB3,
0x05,0x07,0x85,0x87,0x25,0x27,0xA5,0xA7, 0x15,0x17,0x95,0x97,0x35,0x37,0xB5,0xB7,
0x41,0x43,0xC1,0xC3,0x61,0x63,0xE1,0xE3, 0x51,0x53,0xD1,0xD3,0x71,0x73,0xF1,0xF3,
0x45,0x47,0xC5,0xC7,0x65,0x67,0xE5,0xE7, 0x55,0x57,0xD5,0xD7,0x75,0x77,0xF5,0xF7,
0x08,0x0A,0x88,0x8A,0x28,0x2A,0xA8,0xAA, 0x18,0x1A,0x98,0x9A,0x38,0x3A,0xB8,0xBA,
0x0C,0x0E,0x8C,0x8E,0x2C,0x2E,0xAC,0xAE, 0x1C,0x1E,0x9C,0x9E,0x3C,0x3E,0xBC,0xBE,
0x48,0x4A,0xC8,0xCA,0x68,0x6A,0xE8,0xEA, 0x58,0x5A,0xD8,0xDA,0x78,0x7A,0xF8,0xFA,
0x4C,0x4E,0xCC,0xCE,0x6C,0x6E,0xEC,0xEE, 0x5C,0x5E,0xDC,0xDE,0x7C,0x7E,0xFC,0xFE,
0x09,0x0B,0x89,0x8B,0x29,0x2B,0xA9,0xAB, 0x19,0x1B,0x99,0x9B,0x39,0x3B,0xB9,0xBB,
0x0D,0x0F,0x8D,0x8F,0x2D,0x2F,0xAD,0xAF, 0x1D,0x1F,0x9D,0x9F,0x3D,0x3F,0xBD,0xBF,
0x49,0x4B,0xC9,0xCB,0x69,0x6B,0xE9,0xEB, 0x59,0x5B,0xD9,0xDB,0x79,0x7B,0xF9,0xFB,
0x4D,0x4F,0xCD,0xCF,0x6D,0x6F,0xED,0xEF, 0x5D,0x5F,0xDD,0xDF,0x7D,0x7F,0xFD,0xFF,
};
static void csa_BlockDecypher( uint8_t kk[57], uint8_t ib[8], uint8_t bd[8] )
{
int i;
int perm_out;
int R[9];
int next_R8;
for( i = 0; i < 8; i++ )
{
R[i+1] = ib[i];
}
// loop over kk[56]..kk[1]
for( i = 56; i > 0; i-- )
{
const int sbox_out = block_sbox[ kk[i]^R[7] ];
perm_out = block_perm[sbox_out];
next_R8 = R[7];
R[7] = R[6] ^ perm_out;
R[6] = R[5];
R[5] = R[4] ^ R[8] ^ sbox_out;
R[4] = R[3] ^ R[8] ^ sbox_out;
R[3] = R[2] ^ R[8] ^ sbox_out;
R[2] = R[1];
R[1] = R[8] ^ sbox_out;
R[8] = next_R8;
}
for( i = 0; i < 8; i++ )
{
bd[i] = R[i+1];
}
}
static void csa_BlockCypher( uint8_t kk[57], uint8_t bd[8], uint8_t ib[8] )
{
int i;
int perm_out;
int R[9];
int next_R1;
for( i = 0; i < 8; i++ )
{
R[i+1] = bd[i];
}
// loop over kk[1]..kk[56]
for( i = 1; i <= 56; i++ )
{
const int sbox_out = block_sbox[ kk[i]^R[8] ];
perm_out = block_perm[sbox_out];
next_R1 = R[2];
R[2] = R[3] ^ R[1];
R[3] = R[4] ^ R[1];
R[4] = R[5] ^ R[1];
R[5] = R[6];
R[6] = R[7] ^ perm_out;
R[7] = R[8];
R[8] = R[1] ^ sbox_out;
R[1] = next_R1;
}
for( i = 0; i < 8; i++ )
{
ib[i] = R[i+1];
}
}
modules/mux/mpeg/csa.h 0 → 100644
View file @ 0d5eef15
/*****************************************************************************
* csa.h
*****************************************************************************
* Copyright (C) 2004 Laurent Aimar
* $Id: csa.h,v 1.1 2004/01/25 02:26:04 fenrir Exp $
*
* Authors: Laurent Aimar <fenrir@via.ecp.fr>
*
* 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
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
*****************************************************************************/
typedef struct csa_t csa_t;
#define csa_New E_(__csa_New)
#define csa_Delete E_(__csa_Delete)
#define csa_SetCW E_(__csa_SetCW)
#define csa_Decrypt E_(__csa_decrypt)
#define csa_Encrypt E_(__csa_encrypt)
csa_t *csa_New();
void csa_Delete( csa_t * );
void csa_SetCW( csa_t *, uint8_t o_ck[8], uint8_t e_ck[8] );
void csa_Decrypt( csa_t *, uint8_t *pkt );
void csa_Encrypt( csa_t *, uint8_t *pkt, int b_odd );
modules/mux/mpeg/ts.c
View file @ 0d5eef15
......@@ -2,7 +2,7 @@
* ts.c: MPEG-II TS Muxer
*****************************************************************************
* Copyright (C) 2001, 2002 VideoLAN
* $Id: ts.c,v 1.41 2003/11/27 22:44:50 massiot Exp $
* $Id: ts.c,v 1.42 2004/01/25 02:26:04 fenrir Exp $
*
* Authors: Laurent Aimar <fenrir@via.ecp.fr>
* Eric Petit <titer@videolan.org>
......@@ -35,6 +35,7 @@
#include "codecs.h"
#include "bits.h"
#include "pes.h"
#include "csa.h"
#if defined MODULE_NAME_IS_mux_ts_dvbpsi
# ifdef HAVE_DVBPSI_DR_H
......@@ -102,6 +103,7 @@ static int Mux ( sout_mux_t * );
* Local prototypes
*****************************************************************************/
#define SOUT_BUFFER_FLAGS_PRIVATE_PCR ( 1 << SOUT_BUFFER_FLAGS_PRIVATE_SHIFT )
#define SOUT_BUFFER_FLAGS_PRIVATE_CSA ( 2 << SOUT_BUFFER_FLAGS_PRIVATE_SHIFT )
typedef struct
{
int i_depth;
......@@ -212,6 +214,8 @@ struct sout_mux_sys_t
int64_t i_dts_delay;
mtime_t i_pcr; /* last PCR emited */
csa_t *csa;
};
......@@ -366,6 +370,36 @@ static int Open( vlc_object_t *p_this )
/* for TS generation */
p_sys->i_pcr = 0;
p_sys->csa = NULL;
if( ( val = sout_cfg_find_value( p_mux->p_cfg, "csa-ck" ) ) )
{
/* skip 0x */
if( val[0] == '0' && ( val[1] == 'x' || val[1] == 'X' ) )
{
val += 2;
}
if( strlen( val ) != 16 )
{
msg_Dbg( p_mux, "invalid csa ck (it must be 16 chars long)" );
}
else
{
uint64_t i_ck = strtoll( val, NULL, 16 );
uint8_t ck[8];
int i;
for( i = 0; i < 8; i++ )
{
ck[i] = ( i_ck >> ( 56 - 8*i) )&0xff;
}
msg_Dbg( p_mux, "using CSA scrambling with ck=%x:%x:%x:%x:%x:%x:%x:%x",
ck[0], ck[1], ck[2], ck[3], ck[4], ck[5], ck[6], ck[7] );
p_sys->csa = csa_New();
csa_SetCW( p_sys->csa, ck, ck );
}
}
return VLC_SUCCESS;
}
......@@ -378,6 +412,10 @@ static void Close( vlc_object_t * p_this )
sout_mux_sys_t *p_sys = p_mux->p_sys;
msg_Dbg( p_mux, "Close" );
if( p_sys->csa )
{
csa_Delete( p_sys->csa );
}
free( p_sys );
}
......@@ -825,6 +863,10 @@ static int Mux( sout_mux_t *p_mux )
/* Build the TS packet */
p_ts = TSNew( p_mux, p_stream, b_pcr );
if( p_sys->csa )
{
p_ts->i_flags |= SOUT_BUFFER_FLAGS_PRIVATE_CSA;
}
i_packet_pos++;
/* */
......@@ -846,6 +888,10 @@ static int Mux( sout_mux_t *p_mux )
/* msg_Dbg( p_mux, "pcr=%lld ms", p_ts->i_dts / 1000 ); */
TSSetPCR( p_ts, p_ts->i_dts - p_sys->i_dts_delay );
}
if( p_ts->i_flags&SOUT_BUFFER_FLAGS_PRIVATE_CSA )
{
csa_Encrypt( p_sys->csa, p_ts->p_buffer, 0 );
}
/* latency */
p_ts->i_dts += 3*p_sys->i_caching_delay/2;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment