[lkml]   [2005]   [Feb]   [12]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [PATCH] OpenBSD Networking-related randomization port
        linux> It's easy to make a smaller hash by just thowing bits away,
    linux> but a block cipher is a permutation, and has to be
    linux> invertible.

    linux> For example, if I take a k-bit counter and encrypt it with
    linux> a k-bit block cipher, the output is guaranteed not to
    linux> repeat in less than 2^k steps, but the value after a given
    linux> value is hard to predict.

    Huh? What if my cipher consists of XOR-ing with a k-bit pattern?
    That's a permutation on the set of k-bit blocks but it happens to
    decompose as a product of (non-overlapping) swaps.

    In general for more realistic block ciphers like DES it seems
    extremely unlikely that the cipher has only a single orbit when viewed
    as a permutation. I would expect a real block cipher to behave more
    like a random permutation, which means that the expected number of
    orbits for a k-bit cipher should be about ln(2^k) or roughly .7 * k.

    - R.
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to
    More majordomo info at
    Please read the FAQ at

     \ /
      Last update: 2005-03-22 14:10    [W:0.019 / U:19.932 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site