[948] in Kerberos_V5_Development
Re: 3-DES string-to-key algorithm
daemon@ATHENA.MIT.EDU (Mark Eichin)
Tue Nov 28 15:19:49 1995
From: Mark Eichin <eichin@cygnus.com>
Date: Tue, 28 Nov 1995 15:18:21 -0500
To: basch@lehman.com
Cc: sommerfeld@orchard.medford.ma.us, basch@lehman.com, cvs-krb5@MIT.EDU,
krbdev@MIT.EDU, tytso@MIT.EDU
In-Reply-To: <199511281444.JAA04156@badger.lehman.com> (basch@lehman.com)
> Actually, the definition was almost completely copied from another
> paper.
That other paper refers to "1's complement addition" -- which I don't
believe that at least one of the author's fully understands. Simply
saying "end-around carry" would be clear, or indicating that
a <+>_n b -> (a+b)mod(n) + (a+b)/n
to make it totally unambiguous would be better...
