Ikhodi ngezinombolo eziyinhloko04
26

Ngo-Okthoba 1999, iqembu elaliholwa nguJon Lech Johansen waseNorway owayeneminyaka eyi-16 ngaleso sikhathi lakhipha uhlelo lwe -DeCSS ukuze ligweme ukuvikelwa kokudlala kwe-DVD ye-Content Scramble System (CSS). I-CSS yasebenzisa ukubethela okungu-40-bit, okhiye ababesatshalaliswa kubakhiqizi abanelayisensi, ukuze ikhawulele ukudlala kwe-DVD. Ngenxa yokuthi ukusatshalaliswa kwekhodi kwawela ngaphansi kwe-US DMCA futhi kwakuvinjelwe ngokomthetho, izishoshovu zafuna izindlela zokufihla ikhodi njengento yezibalo.

---

UPhil Carmody wabe esekha inombolo eyinhloko, lapho ihunyushwa ku-binary ngemva kwe-gzip decompression, iqukethe ikhodi yomthombo ephelele ye-DeCSS. Ingqikithi ye-algorithm ye-DeCSS ingasetshenziswa ku-TypeScript kanje, lapho imisebenzi ye-bit ihlanganisa khona ngqo i-logic ye-sector decryption.:

function CSSdescramble(sec: Uint8Array, key: Uint8Array): void {
    let t1: number, t2: number, t3: number, t4: number, t5: number, t6: number;
    const end = 0x800;

    t1 = (key[0] ^ sec[0x54]) | 0x100;
    t2 = key[1] ^ sec[0x55];

    const keyView = new DataView(key.buffer, key.byteOffset);
    const secView = new DataView(sec.buffer, sec.byteOffset);

    t3 = (keyView.getUint32(2, true) ^ secView.getUint32(0x56, true)) >>> 0;
    t4 = t3 & 7;
    t3 = (t3 * 2 + 8 - t4) >>> 0;

    let offset = 0x80;
    t5 = 0;

    while (offset < end) {
        t4 = CSStab2[t2] ^ CSStab3[t1];
        t2 = t1 >>> 1;
        t1 = ((t1 & 1) << 8) ^ t4;
        t4 = CSStab5[t4];
        t6 = (((((((t3 >>> 3) ^ t3) >>> 1) ^ t3) >>> 8) ^ t3) >>> 5) & 0xff;
        t3 = (((t3 << 8) >>> 0) | t6) >>> 0;
        t6 = CSStab4[t6];
        t5 += t6 + t4;

        sec[offset] = CSStab1[sec[offset]] ^ (t5 & 0xff);
        t5 >>>= 8;
        offset++;
    }
}

Isimiso esingemuva kwenombolo eyinhloko ukuhumusha yonke ikhodi yomthombo njengenombolo eyodwa eqinile. Njengoba kungekho fayela elinikeziwe eliyinombolo eyinhloko, inombolo ikhuliswa ngokwenziwa ngama-byte engeziwe (i-padding). Le padding ikhuliswa ku-loop kuze kube yilapho ukuhlolwa kwe-primality, njengokuhlolwa kwe-Miller-Rabin, kuqinisekisa ukuthi inombolo iyinhloko. Ijeneretha elandelayo isebenzisa ikhodi ye-DeCSS echazwe ngenhla futhi isesha ukumelwa kwenombolo eyinhloko ehambisanayo.:

import { isPrime } from 'crypto-utils-lib'; // Hypothetical library for primality testing

async function generateIllegalPrime(code: string): Promise<bigint | null> {
    const encoder = new TextEncoder();
    const bytes = encoder.encode(code);

    let hexBase = Array.from(bytes)
        .map(b => b.toString(16).padStart(2, '0'))
        .join('');

    // Start bei 1, da 0x00 immer gerade und damit keine Primzahl ist
    for (let i = 1; i < 256; i++) {
        const candidateHex = hexBase + i.toString(16).padStart(2, '0');
        const candidateInt = BigInt('0x' + candidateHex);

        if (await isPrime(candidateInt)) {
            return candidateInt;
        }
    }
    return null;
}

const source = `void CSSdescramble(unsigned char *sec, unsigned char *key) { ... }`;
generateIllegalPrime(source).then(p => console.log(p));

Icebo lenombolo eyinhloko alizange libe yindaba yecala elihlukile lenkantolo, futhi kwakungadingeki libe njalo. Nakuba inombolo eyinhloko yokuqala kaCarmody yayinezinombolo ezingu-1401, yayincane kakhulu ohlwini oluphezulu lwezinombolo eziyinhloko ezinkulu ngaleso sikhathi. Kamuva wadala inguqulo enezinombolo ezingu-1905, efakwe ama-null byte ngokwenziwa, ukuze afinyelele endaweni yeshumi ku- ECPP ranking . Le mpumelelo yabonisa ukungenzeki kokunciphisa izibalo ezihlanzekile, njengoba inombolo yathola indawo yayo ohlwini kuphela ngokusekelwe ezicini zayo zezibalo.