#!/usr/bin/env python3 # # Copyright (C) 2013 by the Massachusetts Institute of Technology. # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions # are met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # # * Redistributions in binary form must reproduce the above copyright # notice, this list of conditions and the following disclaimer in # the documentation and/or other materials provided with the # distribution. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS # FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE # COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, # INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES # (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR # SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) # HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, # STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED # OF THE POSSIBILITY OF SUCH DAMAGE. # XXX current status: # * Done and tested # - AES encryption, checksum, string2key, prf # - cf2 (needed for FAST) # * Still to do: # - DES enctypes and cksumtypes # - RC4 exported enctype (if we need it for anything) # - Unkeyed checksums # - Special RC4, raw DES/DES3 operations for GSSAPI # * Difficult or low priority: # - Camellia not supported by PyCrypto # - Cipher state only needed for kcmd suite # - Nonstandard enctypes and cksumtypes like des-hmac-sha1 import sys import os sys.path.insert(0, "bin/python") os.environ["PYTHONUNBUFFERED"] = "1" from math import gcd from functools import reduce from struct import pack, unpack from binascii import crc32 from cryptography.hazmat.primitives import hashes from cryptography.hazmat.primitives import hmac from cryptography.hazmat.primitives.ciphers import algorithms as ciphers from cryptography.hazmat.primitives.ciphers import modes from cryptography.hazmat.primitives.ciphers.base import Cipher from cryptography.hazmat.backends import default_backend from cryptography.hazmat.primitives.kdf.pbkdf2 import PBKDF2HMAC from samba.tests import TestCase from samba.credentials import Credentials from samba import generate_random_bytes as get_random_bytes from samba.common import get_string, get_bytes class Enctype(object): DES_CRC = 1 DES_MD4 = 2 DES_MD5 = 3 DES3 = 16 AES128 = 17 AES256 = 18 RC4 = 23 class Cksumtype(object): CRC32 = 1 MD4 = 2 MD4_DES = 3 MD5 = 7 MD5_DES = 8 SHA1 = 9 SHA1_DES3 = 12 SHA1_AES128 = 15 SHA1_AES256 = 16 HMAC_MD5 = -138 class InvalidChecksum(ValueError): pass def _zeropad(s, padsize): # Return s padded with 0 bytes to a multiple of padsize. padlen = (padsize - (len(s) % padsize)) % padsize return s + bytes(padlen) def _xorbytes(b1, b2): # xor two strings together and return the resulting string. assert len(b1) == len(b2) return bytes([x ^ y for x, y in zip(b1, b2)]) def _mac_equal(mac1, mac2): # Constant-time comparison function. (We can't use HMAC.verify # since we use truncated macs.) assert len(mac1) == len(mac2) res = 0 for x, y in zip(mac1, mac2): res |= x ^ y return res == 0 def SIMPLE_HASH(string, algo_cls): hash_ctx = hashes.Hash(algo_cls(), default_backend()) hash_ctx.update(string) return hash_ctx.finalize() def HMAC_HASH(key, string, algo_cls): hmac_ctx = hmac.HMAC(key, algo_cls(), default_backend()) hmac_ctx.update(string) return hmac_ctx.finalize() def _nfold(str, nbytes): # Convert str to a string of length nbytes using the RFC 3961 nfold # operation. # Rotate the bytes in str to the right by nbits bits. def rotate_right(str, nbits): nbytes, remain = (nbits // 8) % len(str), nbits % 8 return bytes([ (str[i - nbytes] >> remain) | (str[i - nbytes - 1] << (8 - remain) & 0xff) for i in range(len(str))]) # Add equal-length strings together with end-around carry. def add_ones_complement(str1, str2): n = len(str1) v = [a + b for a, b in zip(str1, str2)] # Propagate carry bits to the left until there aren't any left. while any(x & ~0xff for x in v): v = [(v[i - n + 1] >> 8) + (v[i] & 0xff) for i in range(n)] return bytes([x for x in v]) # Concatenate copies of str to produce the least common multiple # of len(str) and nbytes, rotating each copy of str to the right # by 13 bits times its list position. Decompose the concatenation # into slices of length nbytes, and add them together as # big-endian ones' complement integers. slen = len(str) lcm = nbytes * slen // gcd(nbytes, slen) bigstr = b''.join((rotate_right(str, 13 * i) for i in range(lcm // slen))) slices = (bigstr[p:p + nbytes] for p in range(0, lcm, nbytes)) return reduce(add_ones_complement, slices) def _is_weak_des_key(keybytes): return keybytes in (b'\x01\x01\x01\x01\x01\x01\x01\x01', b'\xFE\xFE\xFE\xFE\xFE\xFE\xFE\xFE', b'\x1F\x1F\x1F\x1F\x0E\x0E\x0E\x0E', b'\xE0\xE0\xE0\xE0\xF1\xF1\xF1\xF1', b'\x01\xFE\x01\xFE\x01\xFE\x01\xFE', b'\xFE\x01\xFE\x01\xFE\x01\xFE\x01', b'\x1F\xE0\x1F\xE0\x0E\xF1\x0E\xF1', b'\xE0\x1F\xE0\x1F\xF1\x0E\xF1\x0E', b'\x01\xE0\x01\xE0\x01\xF1\x01\xF1', b'\xE0\x01\xE0\x01\xF1\x01\xF1\x01', b'\x1F\xFE\x1F\xFE\x0E\xFE\x0E\xFE', b'\xFE\x1F\xFE\x1F\xFE\x0E\xFE\x0E', b'\x01\x1F\x01\x1F\x01\x0E\x01\x0E', b'\x1F\x01\x1F\x01\x0E\x01\x0E\x01', b'\xE0\xFE\xE0\xFE\xF1\xFE\xF1\xFE', b'\xFE\xE0\xFE\xE0\xFE\xF1\xFE\xF1') class _EnctypeProfile(object): # Base class for enctype profiles. Usable enctype classes must define: # * enctype: enctype number # * keysize: protocol size of key in bytes # * seedsize: random_to_key input size in bytes # * random_to_key (if the keyspace is not dense) # * string_to_key # * encrypt # * decrypt # * prf @classmethod def random_to_key(cls, seed): if len(seed) != cls.seedsize: raise ValueError('Wrong seed length') return Key(cls.enctype, seed) class _SimplifiedEnctype(_EnctypeProfile): # Base class for enctypes using the RFC 3961 simplified profile. # Defines the encrypt, decrypt, and prf methods. Subclasses must # define: # * blocksize: Underlying cipher block size in bytes # * padsize: Underlying cipher padding multiple (1 or blocksize) # * macsize: Size of integrity MAC in bytes # * hashmod: PyCrypto hash module for underlying hash function # * basic_encrypt, basic_decrypt: Underlying CBC/CTS cipher @classmethod def derive(cls, key, constant): # RFC 3961 only says to n-fold the constant only if it is # shorter than the cipher block size. But all Unix # implementations n-fold constants if their length is larger # than the block size as well, and n-folding when the length # is equal to the block size is a no-op. plaintext = _nfold(constant, cls.blocksize) rndseed = b'' while len(rndseed) < cls.seedsize: ciphertext = cls.basic_encrypt(key, plaintext) rndseed += ciphertext plaintext = ciphertext return cls.random_to_key(rndseed[0:cls.seedsize]) @classmethod def encrypt(cls, key, keyusage, plaintext, confounder): ki = cls.derive(key, pack('>iB', keyusage, 0x55)) ke = cls.derive(key, pack('>iB', keyusage, 0xAA)) if confounder is None: confounder = get_random_bytes(cls.blocksize) basic_plaintext = confounder + _zeropad(plaintext, cls.padsize) hmac = HMAC_HASH(ki.contents, basic_plaintext, cls.hashalgo) return cls.basic_encrypt(ke, basic_plaintext) + hmac[:cls.macsize] @classmethod def decrypt(cls, key, keyusage, ciphertext): ki = cls.derive(key, pack('>iB', keyusage, 0x55)) ke = cls.derive(key, pack('>iB', keyusage, 0xAA)) if len(ciphertext) < cls.blocksize + cls.macsize: raise ValueError('ciphertext too short') basic_ctext, mac = ciphertext[:-cls.macsize], ciphertext[-cls.macsize:] if len(basic_ctext) % cls.padsize != 0: raise ValueError('ciphertext does not meet padding requirement') basic_plaintext = cls.basic_decrypt(ke, basic_ctext) hmac = HMAC_HASH(ki.contents, basic_plaintext, cls.hashalgo) expmac = hmac[:cls.macsize] if not _mac_equal(mac, expmac): raise InvalidChecksum('ciphertext integrity failure') # Discard the confounder. return basic_plaintext[cls.blocksize:] @classmethod def prf(cls, key, string): # Hash the input. RFC 3961 says to truncate to the padding # size, but implementations truncate to the block size. hashval = SIMPLE_HASH(string, cls.hashalgo) truncated = hashval[:-(len(hashval) % cls.blocksize)] # Encrypt the hash with a derived key. kp = cls.derive(key, b'prf') return cls.basic_encrypt(kp, truncated) class _DES3CBC(_SimplifiedEnctype): enctype = Enctype.DES3 keysize = 24 seedsize = 21 blocksize = 8 padsize = 8 macsize = 20 hashalgo = hashes.SHA1 @classmethod def random_to_key(cls, seed): # XXX Maybe reframe as _DESEnctype.random_to_key and use that # way from DES3 random-to-key when DES is implemented, since # MIT does this instead of the RFC 3961 random-to-key. def expand(seed): def parity(b): # Return b with the low-order bit set to yield odd parity. b &= ~1 return b if bin(b & ~1).count('1') % 2 else b | 1 assert len(seed) == 7 firstbytes = [parity(b & ~1) for b in seed] lastbyte = parity(sum((seed[i] & 1) << i + 1 for i in range(7))) keybytes = bytes([b for b in firstbytes + [lastbyte]]) if _is_weak_des_key(keybytes): keybytes[7] = bytes([keybytes[7] ^ 0xF0]) return keybytes if len(seed) != 21: raise ValueError('Wrong seed length') k1, k2, k3 = expand(seed[:7]), expand(seed[7:14]), expand(seed[14:]) return Key(cls.enctype, k1 + k2 + k3) @classmethod def string_to_key(cls, string, salt, params): if params is not None and params != b'': raise ValueError('Invalid DES3 string-to-key parameters') k = cls.random_to_key(_nfold(string + salt, 21)) return cls.derive(k, b'kerberos') @classmethod def basic_encrypt(cls, key, plaintext): assert len(plaintext) % 8 == 0 algo = ciphers.TripleDES(key.contents) cbc = modes.CBC(bytes(8)) encryptor = Cipher(algo, cbc, default_backend()).encryptor() ciphertext = encryptor.update(plaintext) return ciphertext @classmethod def basic_decrypt(cls, key, ciphertext): assert len(ciphertext) % 8 == 0 algo = ciphers.TripleDES(key.contents) cbc = modes.CBC(bytes(8)) decryptor = Cipher(algo, cbc, default_backend()).decryptor() plaintext = decryptor.update(ciphertext) return plaintext class _AESEnctype(_SimplifiedEnctype): # Base class for aes128-cts and aes256-cts. blocksize = 16 padsize = 1 macsize = 12 hashalgo = hashes.SHA1 @classmethod def string_to_key(cls, string, salt, params): (iterations,) = unpack('>L', params or b'\x00\x00\x10\x00') pwbytes = get_bytes(string) kdf = PBKDF2HMAC(algorithm=hashes.SHA1(), length=cls.seedsize, salt=salt, iterations=iterations, backend=default_backend()) seed = kdf.derive(pwbytes) tkey = cls.random_to_key(seed) return cls.derive(tkey, b'kerberos') @classmethod def basic_encrypt(cls, key, plaintext): assert len(plaintext) >= 16 algo = ciphers.AES(key.contents) cbc = modes.CBC(bytes(16)) aes_ctx = Cipher(algo, cbc, default_backend()) def aes_encrypt(plaintext): encryptor = aes_ctx.encryptor() ciphertext = encryptor.update(plaintext) return ciphertext ctext = aes_encrypt(_zeropad(plaintext, 16)) if len(plaintext) > 16: # Swap the last two ciphertext blocks and truncate the # final block to match the plaintext length. lastlen = len(plaintext) % 16 or 16 ctext = ctext[:-32] + ctext[-16:] + ctext[-32:-16][:lastlen] return ctext @classmethod def basic_decrypt(cls, key, ciphertext): assert len(ciphertext) >= 16 algo = ciphers.AES(key.contents) cbc = modes.CBC(bytes(16)) aes_ctx = Cipher(algo, cbc, default_backend()) def aes_decrypt(ciphertext): decryptor = aes_ctx.decryptor() plaintext = decryptor.update(ciphertext) return plaintext if len(ciphertext) == 16: return aes_decrypt(ciphertext) # Split the ciphertext into blocks. The last block may be partial. cblocks = [ciphertext[p:p + 16] for p in range(0, len(ciphertext), 16)] lastlen = len(cblocks[-1]) # CBC-decrypt all but the last two blocks. prev_cblock = bytes(16) plaintext = b'' for b in cblocks[:-2]: plaintext += _xorbytes(aes_decrypt(b), prev_cblock) prev_cblock = b # Decrypt the second-to-last cipher block. The left side of # the decrypted block will be the final block of plaintext # xor'd with the final partial cipher block; the right side # will be the omitted bytes of ciphertext from the final # block. b = aes_decrypt(cblocks[-2]) lastplaintext = _xorbytes(b[:lastlen], cblocks[-1]) omitted = b[lastlen:] # Decrypt the final cipher block plus the omitted bytes to get # the second-to-last plaintext block. plaintext += _xorbytes(aes_decrypt(cblocks[-1] + omitted), prev_cblock) return plaintext + lastplaintext class _AES128CTS(_AESEnctype): enctype = Enctype.AES128 keysize = 16 seedsize = 16 class _AES256CTS(_AESEnctype): enctype = Enctype.AES256 keysize = 32 seedsize = 32 class _RC4(_EnctypeProfile): enctype = Enctype.RC4 keysize = 16 seedsize = 16 @staticmethod def usage_str(keyusage): # Return a four-byte string for an RFC 3961 keyusage, using # the RFC 4757 rules. Per the errata, do not map 9 to 8. table = {3: 8, 23: 13} msusage = table[keyusage] if keyusage in table else keyusage return pack('iB', keyusage, 0x99)) hmac = HMAC_HASH(kc.contents, text, cls.enc.hashalgo) return hmac[:cls.macsize] @classmethod def verify(cls, key, keyusage, text, cksum): if key.enctype != cls.enc.enctype: raise ValueError('Wrong key type for checksum') super(_SimplifiedChecksum, cls).verify(key, keyusage, text, cksum) @classmethod def checksum_len(cls): return cls.macsize class _SHA1AES128(_SimplifiedChecksum): macsize = 12 enc = _AES128CTS class _SHA1AES256(_SimplifiedChecksum): macsize = 12 enc = _AES256CTS class _SHA1DES3(_SimplifiedChecksum): macsize = 20 enc = _DES3CBC class _HMACMD5(_ChecksumProfile): @classmethod def checksum(cls, key, keyusage, text): ksign = HMAC_HASH(key.contents, b'signaturekey\0', hashes.MD5) md5hash = SIMPLE_HASH(_RC4.usage_str(keyusage) + text, hashes.MD5) return HMAC_HASH(ksign, md5hash, hashes.MD5) @classmethod def verify(cls, key, keyusage, text, cksum): if key.enctype != Enctype.RC4: raise ValueError('Wrong key type for checksum') super(_HMACMD5, cls).verify(key, keyusage, text, cksum) @classmethod def checksum_len(cls): return hashes.MD5.digest_size class _MD5(_ChecksumProfile): @classmethod def checksum(cls, key, keyusage, text): # This is unkeyed! return SIMPLE_HASH(text, hashes.MD5) @classmethod def checksum_len(cls): return hashes.MD5.digest_size class _SHA1(_ChecksumProfile): @classmethod def checksum(cls, key, keyusage, text): # This is unkeyed! return SIMPLE_HASH(text, hashes.SHA1) @classmethod def checksum_len(cls): return hashes.SHA1.digest_size class _CRC32(_ChecksumProfile): @classmethod def checksum(cls, key, keyusage, text): # This is unkeyed! cksum = (~crc32(text, 0xffffffff)) & 0xffffffff return pack('