aboutsummaryrefslogtreecommitdiff
path: root/utils/last_gasp_default_pin
blob: 50d822fa8f33be2eb300447702188f9e852eb730 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#!/usr/bin/env python

"""
Somewhere, the HSM has to have a last-gasp default PIN, even if it's
only the null string, because there has to be **some** way to
initialize the poor thing.  Absent a better plan (feel free to
suggest one!), this last-gasp default is compiled in.

The normal value of this last-gasp PIN is deliberately chosen to be
annoying, so that people will change it, but since the derevation
requires running PBKDF2 and you might want a different default if
you're compiling this for yourself, we provide the script that
generates the default.
"""

# Author: Rob Austein
# Copyright (c) 2016, NORDUnet A/S
# 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.
#
# - Neither the name of the NORDUnet nor the names of its contributors may
#   be used to endorse or promote products derived from this software
#   without specific prior written permission.
#
# 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.

from argparse                   import ArgumentParser, ArgumentDefaultsHelpFormatter
from os                         import urandom
from Crypto.Protocol.KDF        import PBKDF2
from Crypto.Hash                import SHA256, HMAC

parser = ArgumentParser(description = __doc__, formatter_class = ArgumentDefaultsHelpFormatter)
parser.add_argument("-p", "--pin",
                    default = "YouReallyNeedToChangeThisPINRightNowWeAreNotKidding",
                    help    = "PIN plaintext before PBKDF2 processing")
parser.add_argument("-i", "--iterations",
                    type    = int,
                    default = 10000,
                    help    = "PBKDF2 iteration count")
parser.add_argument("-d", "--derived-key-length",
                    type    = int,
                    default = 64,
                    help    = "length of PBKDF2 output (must match libhal)")
args = parser.parse_args()

def HMAC_SHA256(pin, salt):
    return HMAC.new(pin, salt, SHA256).digest()

def hexify(value):
    return ", ".join("0x%02x" % ord(v) for v in value)

salt = urandom(16)

pin  = PBKDF2(password = args.pin,
              salt     = salt,
              dkLen    = args.derived_key_length,
              count    = args.iterations,
              prf      = HMAC_SHA256)

print '''\
/*
 * Automatically generated by a script, do not edit.
 */

static const hal_ks_pin_t hal_last_gasp_pin = {{
  {iterations},
  {{{pin}}},
  {{{salt}}}
}};'''.format(iterations = args.iterations,
              pin        = hexify(pin),
              salt       = hexify(salt))
class="s2">"output", nargs = "?", type = FileType("w"), default = sys.stdout, help = "output file") args = parser.parse_args() plaintext = "You can hack anything you want with TECO and DDT." scriptname = os.path.basename(sys.argv[0]) wrapper = TextWrapper(width = 78, initial_indent = " " * 2, subsequent_indent = " " * 2) def printlines(*lines, **kwargs): for line in lines: args.output.write(line % kwargs + "\n") def trailing_comma(item, sequence): return "" if item == sequence[-1] else "," def print_hex(name, value, comment): printlines("static const uint8_t %(name)s[] = { /* %(comment)s, %(length)d bytes */", wrapper.fill(", ".join("0x%02x" % ord(v) for v in value)), "};", "", name = name, comment = comment, length = len(value)) def pad_to_blocksize(value, blocksize): extra = len(value) % blocksize return value if extra == 0 else ("\x00" * (blocksize - extra)) + value # Funnily enough, PyCrypto and Cryptlib use exactly the same names for # RSA key components, see Cryptlib documentation pages 186-187 & 339. h = SHA256.new(plaintext) printlines("/*", " * RSA signature test data for Cryptech project, automatically generated by", " * %(scriptname)s using PyCrypto version %(version)s. Do not edit.", " *", " * Plaintext: \"%(plaintext)s\"", " * SHA-256: %(digest)s", " */", "", scriptname = scriptname, version = PyCryptoVersion, plaintext = plaintext, digest = h.hexdigest()) fields = ("n", "e", "d", "p", "q", "dP", "dQ", "u", "m", "s") for k_len in args.key_lengths: k = RSA.generate(k_len) # Cryptlib insists u < p, probably with good reason, while k.u >= k.p: # and I'm sure not going to argue the math with Peter, k = RSA.generate(k_len) # so keep trying until we pass this test m = EMSA_PKCS1_V1_5_ENCODE(h, k_len/8) s = PKCS115_SigScheme(k).sign(h) assert len(m) == len(s) if args.pad_to_modulus: blocksize = k_len/8 if args.extra_word: blocksize += 4 else: blocksize = 4 printlines("/* %(k_len)d-bit RSA private key (PKCS #%(pkcs)d)", k.exportKey(format = "PEM", pkcs = args.pkcs_encoding), "*/", "", k_len = k_len, pkcs = args.pkcs_encoding) # PyCrypto doesn't precalculate dP or dQ, and for some reason it # does u backwards (uses (1/p % q) and swaps the roles of p and q in # the CRT calculation to compensate), so we just calculate our own. for name in fields: if name in "ms": continue elif name == "dP": value = k.d % (k.p - 1) elif name == "dQ": value = k.d % (k.q - 1) elif name == "u": value = inverse(k.q, k.p) else: value = getattr(k, name) print_hex("%s_%d" % (name, k_len), long_to_bytes(value, blocksize = blocksize), "key component %s" % name) print_hex("m_%d" % k_len, pad_to_blocksize(m, blocksize), "message to be signed") print_hex("s_%d" % k_len, pad_to_blocksize(s, blocksize), "signed message") printlines("typedef struct { const uint8_t *val; size_t len; } rsa_tc_bn_t;", "typedef struct { size_t size; rsa_tc_bn_t %(fields)s; } rsa_tc_t;", "", "static const rsa_tc_t rsa_tc[] = {", fields = ", ".join(fields)) for k_len in args.key_lengths: printlines(" { %(k_len)d,", k_len = k_len) for field in fields: printlines(" { %(field)s_%(k_len)d, sizeof(%(field)s_%(k_len)d) }%(comma)s", field = field, k_len = k_len, comma = trailing_comma(field, fields)) printlines(" }%(comma)s", comma = trailing_comma(k_len, args.key_lengths)) printlines("};")