diff options
| author | Richard Basch <probe@mit.edu> | 1995-12-02 16:30:09 +0000 |
|---|---|---|
| committer | Richard Basch <probe@mit.edu> | 1995-12-02 16:30:09 +0000 |
| commit | 53f829bcce9f8d5bfcc0ba68bdc17f797a892ab2 (patch) | |
| tree | 3eda6da22f710a47d6a5d7a3557c64ec9ed17d3d /doc | |
| parent | 581f693b276ca7ea11bf3d8d4281442e284acb21 (diff) | |
XOR the last octet with 0xf0, not the first, analagous to 1-DES
git-svn-id: svn://anonsvn.mit.edu/krb5/trunk@7155 dc483132-0cff-0310-8789-dd5450dbe970
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/krb5-protocol/3-des.txt | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/krb5-protocol/3-des.txt b/doc/krb5-protocol/3-des.txt index 8023801a2..e2325e84f 100644 --- a/doc/krb5-protocol/3-des.txt +++ b/doc/krb5-protocol/3-des.txt @@ -26,8 +26,8 @@ produce three DES keys sans parity. The 168 bits are then expanded to include odd parity, for use within the DES routines. The three DES keys are then used to encrypt themselves in 3-DES CBC mode, and the result is parity adjusted. Any weak or semi-weak DES keys are first strengthened -by eXclusive-ORing the first octet with the value 0xF0 prior to their -use. +by eXclusive-ORing the key with the constant 0x00000000000000F0 prior to +its use. The n-fold operation used by the string-to-key algorithm replicates the input bit array X until its length is the least common |