Re: Undefined and underdefined algorithms

[Paul Koning <pkoning@xxxxxxxxx>]

>>>>> "dontspam-tzeruch" == dontspam-tzeruch  <dontspam-tzeruch@xxxxxxxxxx> writes:
 dontspam-tzeruch> Maybe I have uncovered another ambiguity

 dontspam-tzeruch> For 3DES I have:

 dontspam-tzeruch> des_set_key((des_cblock *) key, ctx->ck.dk[0]);
 dontspam-tzeruch> des_set_key((des_cblock *) & key[8],
 dontspam-tzeruch> ctx->ck.dk[1]); des_set_key((des_cblock *) &
 dontspam-tzeruch> key[16], ctx->ck.dk[2]);

 dontspam-tzeruch> Which is going 8 bytes between keys, If DES is 56
 dontspam-tzeruch> bit and not 64 bit the extra bytes are being wasted
 dontspam-tzeruch> (the DES key size is 24 - should it have been 21?).

DES has 56 significant bits in the key plus 8 parity bits that serve
no purpose other than to confuse people.  The normal key
representation with DES is 8 bytes; each byte contains 7 key bits plus 
one parity bit (the LSB).

	paul