[946] in Kerberos_V5_Development
Re: 3-DES string-to-key algorithm
daemon@ATHENA.MIT.EDU (Bill Sommerfeld)
Mon Nov 27 22:23:50 1995
To: "Richard Basch" <basch@lehman.com>
Cc: cvs-krb5@MIT.EDU, krbdev@MIT.EDU, tytso@MIT.EDU
In-Reply-To: Your message of "Mon, 27 Nov 1995 20:40:55 -0500 ."
<199511280140.UAA03498@badger.lehman.com>
Date: Mon, 27 Nov 1995 22:17:39 -0500
From: Bill Sommerfeld <sommerfeld@orchard.medford.ma.us>
-----BEGIN PGP SIGNED MESSAGE-----
> n-fold
> To n-fold a number X, replicate the input value to a length that is the
> least common multiple of n and the length of X. Before each repetition,
> the input X is rotated to the right by 13 bit positions. The successive
> n-bit chunks are added together using 1's-complement addition (addition
> with end-around carry) to yield a n-bit result.
This definition is not used by the subsequent text, and is not
sufficiently precise; are the various lengths in bits, bytes, or what?
Is "right" towards the least significant bit or the most significant
bit?
What's the "word size" of the 1's complement addition?
BTW, I strongly urge inclusion of a couple of "regression test" values
with the text..
- Bill
-----BEGIN PGP SIGNATURE-----
Version: 2.6.1
iQCVAwUBMLp/TrT+rHlVUGpxAQFlmwP9HPdjDUaSNC3xcc4vUEOexW1LMT1Qk9zb
DdlJhIinukHGusHW7DApHhmdPYgy4q5CHFo6SNqbAWQGzbGHAvpuURlBKUnVYvtX
HokWZb5JcKEZ13MXOCJGxllSJMpjqC3GLnGUnfp6sf5ReEaRs0WtLFhWJ2bZB7Cl
M91Rf+AtPtw=
=uw4t
-----END PGP SIGNATURE-----
