blob: 1491a844ad9c93094166cd6f312207fd19aef1e3 [file] [log] [blame]
Gilles Peskine0156a152021-01-26 21:23:56 +01001"""Knowledge about cryptographic mechanisms implemented in Mbed TLS.
2
3This module is entirely based on the PSA API.
4"""
5
6# Copyright The Mbed TLS Contributors
7# SPDX-License-Identifier: Apache-2.0
8#
9# Licensed under the Apache License, Version 2.0 (the "License"); you may
10# not use this file except in compliance with the License.
11# You may obtain a copy of the License at
12#
13# http://www.apache.org/licenses/LICENSE-2.0
14#
15# Unless required by applicable law or agreed to in writing, software
16# distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
17# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
18# See the License for the specific language governing permissions and
19# limitations under the License.
20
Gilles Peskineee7554e2021-04-29 20:38:01 +020021import enum
Gilles Peskine0156a152021-01-26 21:23:56 +010022import re
Gilles Peskinee3a08902022-03-19 10:37:33 +010023from typing import FrozenSet, Iterable, List, Optional, Tuple
Gilles Peskine0156a152021-01-26 21:23:56 +010024
Gilles Peskine6f6483f2021-01-27 12:43:24 +010025from mbedtls_dev.asymmetric_key_data import ASYMMETRIC_KEY_DATA
26
Gilles Peskineee7554e2021-04-29 20:38:01 +020027
Gilles Peskine16b25062022-03-18 00:02:15 +010028def short_expression(original: str, level: int = 0) -> str:
Gilles Peskinee8e058c2022-03-17 23:42:25 +010029 """Abbreviate the expression, keeping it human-readable.
30
31 If `level` is 0, just remove parts that are implicit from context,
32 such as a leading ``PSA_KEY_TYPE_``.
33 For larger values of `level`, also abbreviate some names in an
34 unambiguous, but ad hoc way.
35 """
36 short = original
37 short = re.sub(r'\bPSA_(?:ALG|ECC_FAMILY|KEY_[A-Z]+)_', r'', short)
38 short = re.sub(r' +', r'', short)
Gilles Peskine16b25062022-03-18 00:02:15 +010039 if level >= 1:
40 short = re.sub(r'PUBLIC_KEY\b', r'PUB', short)
41 short = re.sub(r'KEY_PAIR\b', r'PAIR', short)
42 short = re.sub(r'\bBRAINPOOL_P', r'BP', short)
43 short = re.sub(r'\bMONTGOMERY\b', r'MGM', short)
44 short = re.sub(r'AEAD_WITH_SHORTENED_TAG\b', r'AEAD_SHORT', short)
45 short = re.sub(r'\bDETERMINISTIC_', r'DET_', short)
46 short = re.sub(r'\bKEY_AGREEMENT\b', r'KA', short)
47 short = re.sub(r'_PSK_TO_MS\b', r'_PSK2MS', short)
Gilles Peskinee8e058c2022-03-17 23:42:25 +010048 return short
49
50
Gilles Peskine8345d632021-04-29 20:38:47 +020051BLOCK_CIPHERS = frozenset(['AES', 'ARIA', 'CAMELLIA', 'DES'])
Gilles Peskineee7554e2021-04-29 20:38:01 +020052BLOCK_MAC_MODES = frozenset(['CBC_MAC', 'CMAC'])
53BLOCK_CIPHER_MODES = frozenset([
54 'CTR', 'CFB', 'OFB', 'XTS', 'CCM_STAR_NO_TAG',
55 'ECB_NO_PADDING', 'CBC_NO_PADDING', 'CBC_PKCS7',
56])
57BLOCK_AEAD_MODES = frozenset(['CCM', 'GCM'])
58
Gilles Peskine8345d632021-04-29 20:38:47 +020059class EllipticCurveCategory(enum.Enum):
60 """Categorization of elliptic curve families.
61
62 The category of a curve determines what algorithms are defined over it.
63 """
64
65 SHORT_WEIERSTRASS = 0
66 MONTGOMERY = 1
67 TWISTED_EDWARDS = 2
68
69 @staticmethod
70 def from_family(family: str) -> 'EllipticCurveCategory':
71 if family == 'PSA_ECC_FAMILY_MONTGOMERY':
72 return EllipticCurveCategory.MONTGOMERY
73 if family == 'PSA_ECC_FAMILY_TWISTED_EDWARDS':
74 return EllipticCurveCategory.TWISTED_EDWARDS
75 # Default to SW, which most curves belong to.
76 return EllipticCurveCategory.SHORT_WEIERSTRASS
77
Gilles Peskineee7554e2021-04-29 20:38:01 +020078
Gilles Peskine0156a152021-01-26 21:23:56 +010079class KeyType:
80 """Knowledge about a PSA key type."""
81
Gilles Peskineb9dbb7f2021-04-29 20:19:57 +020082 def __init__(self, name: str, params: Optional[Iterable[str]] = None) -> None:
Gilles Peskine0156a152021-01-26 21:23:56 +010083 """Analyze a key type.
84
85 The key type must be specified in PSA syntax. In its simplest form,
Gilles Peskinefa3c69a2021-02-16 14:29:22 +010086 `name` is a string 'PSA_KEY_TYPE_xxx' which is the name of a PSA key
Gilles Peskine0156a152021-01-26 21:23:56 +010087 type macro. For key types that take arguments, the arguments can
88 be passed either through the optional argument `params` or by
Gilles Peskine4d0b0892021-04-12 13:41:52 +020089 passing an expression of the form 'PSA_KEY_TYPE_xxx(param1, ...)'
Gilles Peskinefa3c69a2021-02-16 14:29:22 +010090 in `name` as a string.
Gilles Peskine0156a152021-01-26 21:23:56 +010091 """
Gilles Peskined75adfc2021-02-17 18:04:28 +010092
Gilles Peskine0156a152021-01-26 21:23:56 +010093 self.name = name.strip()
Gilles Peskinefa3c69a2021-02-16 14:29:22 +010094 """The key type macro name (``PSA_KEY_TYPE_xxx``).
95
96 For key types constructed from a macro with arguments, this is the
97 name of the macro, and the arguments are in `self.params`.
98 """
Gilles Peskine0156a152021-01-26 21:23:56 +010099 if params is None:
100 if '(' in self.name:
101 m = re.match(r'(\w+)\s*\((.*)\)\Z', self.name)
102 assert m is not None
103 self.name = m.group(1)
Gilles Peskine4d0b0892021-04-12 13:41:52 +0200104 params = m.group(2).split(',')
Gilles Peskinefa3c69a2021-02-16 14:29:22 +0100105 self.params = (None if params is None else
106 [param.strip() for param in params])
107 """The parameters of the key type, if there are any.
108
109 None if the key type is a macro without arguments.
110 """
Gilles Peskined75adfc2021-02-17 18:04:28 +0100111 assert re.match(r'PSA_KEY_TYPE_\w+\Z', self.name)
112
Gilles Peskine0156a152021-01-26 21:23:56 +0100113 self.expression = self.name
Gilles Peskinefa3c69a2021-02-16 14:29:22 +0100114 """A C expression whose value is the key type encoding."""
Gilles Peskine0156a152021-01-26 21:23:56 +0100115 if self.params is not None:
116 self.expression += '(' + ', '.join(self.params) + ')'
Gilles Peskined75adfc2021-02-17 18:04:28 +0100117
Gilles Peskine8345d632021-04-29 20:38:47 +0200118 m = re.match(r'PSA_KEY_TYPE_(\w+)', self.name)
119 assert m
120 self.head = re.sub(r'_(?:PUBLIC_KEY|KEY_PAIR)\Z', r'', m.group(1))
121 """The key type macro name, with common prefixes and suffixes stripped."""
122
Gilles Peskine0156a152021-01-26 21:23:56 +0100123 self.private_type = re.sub(r'_PUBLIC_KEY\Z', r'_KEY_PAIR', self.name)
Gilles Peskinefa3c69a2021-02-16 14:29:22 +0100124 """The key type macro name for the corresponding key pair type.
125
126 For everything other than a public key type, this is the same as
127 `self.name`.
128 """
Gilles Peskinedf639682021-01-26 21:25:34 +0100129
Gilles Peskine16b25062022-03-18 00:02:15 +0100130 def short_expression(self, level: int = 0) -> str:
Gilles Peskinee8e058c2022-03-17 23:42:25 +0100131 """Abbreviate the expression, keeping it human-readable.
132
133 See `crypto_knowledge.short_expression`.
134 """
Gilles Peskine16b25062022-03-18 00:02:15 +0100135 return short_expression(self.expression, level=level)
Gilles Peskinee8e058c2022-03-17 23:42:25 +0100136
Gilles Peskinee6300952021-04-29 21:56:59 +0200137 def is_public(self) -> bool:
138 """Whether the key type is for public keys."""
139 return self.name.endswith('_PUBLIC_KEY')
140
Gilles Peskinedf639682021-01-26 21:25:34 +0100141 ECC_KEY_SIZES = {
142 'PSA_ECC_FAMILY_SECP_K1': (192, 224, 256),
Gilles Peskine0ac258e2021-01-27 13:11:59 +0100143 'PSA_ECC_FAMILY_SECP_R1': (225, 256, 384, 521),
Gilles Peskinedf639682021-01-26 21:25:34 +0100144 'PSA_ECC_FAMILY_SECP_R2': (160,),
145 'PSA_ECC_FAMILY_SECT_K1': (163, 233, 239, 283, 409, 571),
146 'PSA_ECC_FAMILY_SECT_R1': (163, 233, 283, 409, 571),
147 'PSA_ECC_FAMILY_SECT_R2': (163,),
148 'PSA_ECC_FAMILY_BRAINPOOL_P_R1': (160, 192, 224, 256, 320, 384, 512),
149 'PSA_ECC_FAMILY_MONTGOMERY': (255, 448),
Gilles Peskinea00abc62021-03-16 18:25:14 +0100150 'PSA_ECC_FAMILY_TWISTED_EDWARDS': (255, 448),
Gilles Peskinedf639682021-01-26 21:25:34 +0100151 }
152 KEY_TYPE_SIZES = {
153 'PSA_KEY_TYPE_AES': (128, 192, 256), # exhaustive
Gilles Peskinedf639682021-01-26 21:25:34 +0100154 'PSA_KEY_TYPE_ARIA': (128, 192, 256), # exhaustive
155 'PSA_KEY_TYPE_CAMELLIA': (128, 192, 256), # exhaustive
156 'PSA_KEY_TYPE_CHACHA20': (256,), # exhaustive
157 'PSA_KEY_TYPE_DERIVE': (120, 128), # sample
158 'PSA_KEY_TYPE_DES': (64, 128, 192), # exhaustive
159 'PSA_KEY_TYPE_HMAC': (128, 160, 224, 256, 384, 512), # standard size for each supported hash
Manuel Pégourié-Gonnardb12de9f2021-05-03 11:02:56 +0200160 'PSA_KEY_TYPE_PASSWORD': (48, 168, 336), # sample
161 'PSA_KEY_TYPE_PASSWORD_HASH': (128, 256), # sample
162 'PSA_KEY_TYPE_PEPPER': (128, 256), # sample
Gilles Peskinedf639682021-01-26 21:25:34 +0100163 'PSA_KEY_TYPE_RAW_DATA': (8, 40, 128), # sample
164 'PSA_KEY_TYPE_RSA_KEY_PAIR': (1024, 1536), # small sample
165 }
166 def sizes_to_test(self) -> Tuple[int, ...]:
167 """Return a tuple of key sizes to test.
168
169 For key types that only allow a single size, or only a small set of
170 sizes, these are all the possible sizes. For key types that allow a
171 wide range of sizes, these are a representative sample of sizes,
172 excluding large sizes for which a typical resource-constrained platform
173 may run out of memory.
174 """
175 if self.private_type == 'PSA_KEY_TYPE_ECC_KEY_PAIR':
176 assert self.params is not None
177 return self.ECC_KEY_SIZES[self.params[0]]
178 return self.KEY_TYPE_SIZES[self.private_type]
Gilles Peskine397b0282021-01-26 21:26:26 +0100179
180 # "48657265006973206b6579a064617461"
181 DATA_BLOCK = b'Here\000is key\240data'
182 def key_material(self, bits: int) -> bytes:
183 """Return a byte string containing suitable key material with the given bit length.
184
185 Use the PSA export representation. The resulting byte string is one that
186 can be obtained with the following code:
187 ```
188 psa_set_key_type(&attributes, `self.expression`);
189 psa_set_key_bits(&attributes, `bits`);
190 psa_set_key_usage_flags(&attributes, PSA_KEY_USAGE_EXPORT);
191 psa_generate_key(&attributes, &id);
192 psa_export_key(id, `material`, ...);
193 ```
194 """
Gilles Peskine6f6483f2021-01-27 12:43:24 +0100195 if self.expression in ASYMMETRIC_KEY_DATA:
196 if bits not in ASYMMETRIC_KEY_DATA[self.expression]:
197 raise ValueError('No key data for {}-bit {}'
198 .format(bits, self.expression))
199 return ASYMMETRIC_KEY_DATA[self.expression][bits]
Gilles Peskine397b0282021-01-26 21:26:26 +0100200 if bits % 8 != 0:
Gilles Peskine6f6483f2021-01-27 12:43:24 +0100201 raise ValueError('Non-integer number of bytes: {} bits for {}'
202 .format(bits, self.expression))
Gilles Peskine397b0282021-01-26 21:26:26 +0100203 length = bits // 8
204 if self.name == 'PSA_KEY_TYPE_DES':
205 # "644573206b457901644573206b457902644573206b457904"
206 des3 = b'dEs kEy\001dEs kEy\002dEs kEy\004'
207 return des3[:length]
Gilles Peskine397b0282021-01-26 21:26:26 +0100208 return b''.join([self.DATA_BLOCK] * (length // len(self.DATA_BLOCK)) +
209 [self.DATA_BLOCK[:length % len(self.DATA_BLOCK)]])
gabor-mezei-arm2784bfe2021-06-28 20:02:11 +0200210
Gilles Peskine8345d632021-04-29 20:38:47 +0200211 def can_do(self, alg: 'Algorithm') -> bool:
212 """Whether this key type can be used for operations with the given algorithm.
213
214 This function does not currently handle key derivation or PAKE.
215 """
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100216 #pylint: disable=too-many-branches,too-many-return-statements
Gilles Peskine8345d632021-04-29 20:38:47 +0200217 if alg.is_wildcard:
218 return False
Gilles Peskinee3a08902022-03-19 10:37:33 +0100219 if alg.is_invalid_truncation():
220 return False
Gilles Peskine8345d632021-04-29 20:38:47 +0200221 if self.head == 'HMAC' and alg.head == 'HMAC':
222 return True
Gilles Peskinec47d3a42022-03-18 10:18:58 +0100223 if self.head == 'DES':
224 # 64-bit block ciphers only allow a reduced set of modes.
225 return alg.head in [
226 'CBC_NO_PADDING', 'CBC_PKCS7',
227 'ECB_NO_PADDING',
228 ]
Gilles Peskine8345d632021-04-29 20:38:47 +0200229 if self.head in BLOCK_CIPHERS and \
230 alg.head in frozenset.union(BLOCK_MAC_MODES,
231 BLOCK_CIPHER_MODES,
232 BLOCK_AEAD_MODES):
Gilles Peskine7095d472022-03-19 10:49:43 +0100233 if alg.head in ['CMAC', 'OFB'] and \
234 self.head in ['ARIA', 'CAMELLIA']:
235 return False # not implemented in Mbed TLS
Gilles Peskine8345d632021-04-29 20:38:47 +0200236 return True
237 if self.head == 'CHACHA20' and alg.head == 'CHACHA20_POLY1305':
238 return True
239 if self.head in {'ARC4', 'CHACHA20'} and \
240 alg.head == 'STREAM_CIPHER':
241 return True
242 if self.head == 'RSA' and alg.head.startswith('RSA_'):
243 return True
244 if self.head == 'ECC':
245 assert self.params is not None
246 eccc = EllipticCurveCategory.from_family(self.params[0])
247 if alg.head == 'ECDH' and \
248 eccc in {EllipticCurveCategory.SHORT_WEIERSTRASS,
249 EllipticCurveCategory.MONTGOMERY}:
250 return True
251 if alg.head == 'ECDSA' and \
252 eccc == EllipticCurveCategory.SHORT_WEIERSTRASS:
253 return True
254 if alg.head in {'PURE_EDDSA', 'EDDSA_PREHASH'} and \
255 eccc == EllipticCurveCategory.TWISTED_EDWARDS:
256 return True
257 return False
258
Gilles Peskineee7554e2021-04-29 20:38:01 +0200259
260class AlgorithmCategory(enum.Enum):
261 """PSA algorithm categories."""
262 # The numbers are aligned with the category bits in numerical values of
263 # algorithms.
264 HASH = 2
265 MAC = 3
266 CIPHER = 4
267 AEAD = 5
268 SIGN = 6
269 ASYMMETRIC_ENCRYPTION = 7
270 KEY_DERIVATION = 8
271 KEY_AGREEMENT = 9
272 PAKE = 10
273
274 def requires_key(self) -> bool:
Gilles Peskinee6300952021-04-29 21:56:59 +0200275 """Whether operations in this category are set up with a key."""
Gilles Peskineee7554e2021-04-29 20:38:01 +0200276 return self not in {self.HASH, self.KEY_DERIVATION}
277
Gilles Peskinee6300952021-04-29 21:56:59 +0200278 def is_asymmetric(self) -> bool:
279 """Whether operations in this category involve asymmetric keys."""
280 return self in {
281 self.SIGN,
282 self.ASYMMETRIC_ENCRYPTION,
283 self.KEY_AGREEMENT
284 }
285
Gilles Peskineee7554e2021-04-29 20:38:01 +0200286
287class AlgorithmNotRecognized(Exception):
288 def __init__(self, expr: str) -> None:
289 super().__init__('Algorithm not recognized: ' + expr)
290 self.expr = expr
291
292
293class Algorithm:
294 """Knowledge about a PSA algorithm."""
295
296 @staticmethod
297 def determine_base(expr: str) -> str:
298 """Return an expression for the "base" of the algorithm.
299
300 This strips off variants of algorithms such as MAC truncation.
301
302 This function does not attempt to detect invalid inputs.
303 """
304 m = re.match(r'PSA_ALG_(?:'
305 r'(?:TRUNCATED|AT_LEAST_THIS_LENGTH)_MAC|'
306 r'AEAD_WITH_(?:SHORTENED|AT_LEAST_THIS_LENGTH)_TAG'
307 r')\((.*),[^,]+\)\Z', expr)
308 if m:
309 expr = m.group(1)
310 return expr
311
312 @staticmethod
313 def determine_head(expr: str) -> str:
314 """Return the head of an algorithm expression.
315
316 The head is the first (outermost) constructor, without its PSA_ALG_
317 prefix, and with some normalization of similar algorithms.
318 """
319 m = re.match(r'PSA_ALG_(?:DETERMINISTIC_)?(\w+)', expr)
320 if not m:
321 raise AlgorithmNotRecognized(expr)
322 head = m.group(1)
323 if head == 'KEY_AGREEMENT':
324 m = re.match(r'PSA_ALG_KEY_AGREEMENT\s*\(\s*PSA_ALG_(\w+)', expr)
325 if not m:
326 raise AlgorithmNotRecognized(expr)
327 head = m.group(1)
328 head = re.sub(r'_ANY\Z', r'', head)
329 if re.match(r'ED[0-9]+PH\Z', head):
330 head = 'EDDSA_PREHASH'
331 return head
332
333 CATEGORY_FROM_HEAD = {
334 'SHA': AlgorithmCategory.HASH,
335 'SHAKE256_512': AlgorithmCategory.HASH,
336 'MD': AlgorithmCategory.HASH,
337 'RIPEMD': AlgorithmCategory.HASH,
338 'ANY_HASH': AlgorithmCategory.HASH,
339 'HMAC': AlgorithmCategory.MAC,
340 'STREAM_CIPHER': AlgorithmCategory.CIPHER,
341 'CHACHA20_POLY1305': AlgorithmCategory.AEAD,
342 'DSA': AlgorithmCategory.SIGN,
343 'ECDSA': AlgorithmCategory.SIGN,
344 'EDDSA': AlgorithmCategory.SIGN,
345 'PURE_EDDSA': AlgorithmCategory.SIGN,
346 'RSA_PSS': AlgorithmCategory.SIGN,
347 'RSA_PKCS1V15_SIGN': AlgorithmCategory.SIGN,
348 'RSA_PKCS1V15_CRYPT': AlgorithmCategory.ASYMMETRIC_ENCRYPTION,
349 'RSA_OAEP': AlgorithmCategory.ASYMMETRIC_ENCRYPTION,
350 'HKDF': AlgorithmCategory.KEY_DERIVATION,
351 'TLS12_PRF': AlgorithmCategory.KEY_DERIVATION,
352 'TLS12_PSK_TO_MS': AlgorithmCategory.KEY_DERIVATION,
353 'PBKDF': AlgorithmCategory.KEY_DERIVATION,
354 'ECDH': AlgorithmCategory.KEY_AGREEMENT,
355 'FFDH': AlgorithmCategory.KEY_AGREEMENT,
356 # KEY_AGREEMENT(...) is a key derivation with a key agreement component
357 'KEY_AGREEMENT': AlgorithmCategory.KEY_DERIVATION,
358 'JPAKE': AlgorithmCategory.PAKE,
359 }
360 for x in BLOCK_MAC_MODES:
361 CATEGORY_FROM_HEAD[x] = AlgorithmCategory.MAC
362 for x in BLOCK_CIPHER_MODES:
363 CATEGORY_FROM_HEAD[x] = AlgorithmCategory.CIPHER
364 for x in BLOCK_AEAD_MODES:
365 CATEGORY_FROM_HEAD[x] = AlgorithmCategory.AEAD
366
367 def determine_category(self, expr: str, head: str) -> AlgorithmCategory:
368 """Return the category of the given algorithm expression.
369
370 This function does not attempt to detect invalid inputs.
371 """
372 prefix = head
373 while prefix:
374 if prefix in self.CATEGORY_FROM_HEAD:
375 return self.CATEGORY_FROM_HEAD[prefix]
376 if re.match(r'.*[0-9]\Z', prefix):
377 prefix = re.sub(r'_*[0-9]+\Z', r'', prefix)
378 else:
379 prefix = re.sub(r'_*[^_]*\Z', r'', prefix)
380 raise AlgorithmNotRecognized(expr)
381
382 @staticmethod
383 def determine_wildcard(expr) -> bool:
384 """Whether the given algorithm expression is a wildcard.
385
386 This function does not attempt to detect invalid inputs.
387 """
388 if re.search(r'\bPSA_ALG_ANY_HASH\b', expr):
389 return True
390 if re.search(r'_AT_LEAST_', expr):
391 return True
392 return False
393
394 def __init__(self, expr: str) -> None:
395 """Analyze an algorithm value.
396
397 The algorithm must be expressed as a C expression containing only
398 calls to PSA algorithm constructor macros and numeric literals.
399
400 This class is only programmed to handle valid expressions. Invalid
401 expressions may result in exceptions or in nonsensical results.
402 """
403 self.expression = re.sub(r'\s+', r'', expr)
404 self.base_expression = self.determine_base(self.expression)
405 self.head = self.determine_head(self.base_expression)
406 self.category = self.determine_category(self.base_expression, self.head)
407 self.is_wildcard = self.determine_wildcard(self.expression)
Gilles Peskinea4013862021-04-29 20:54:40 +0200408
409 def is_key_agreement_with_derivation(self) -> bool:
410 """Whether this is a combined key agreement and key derivation algorithm."""
411 if self.category != AlgorithmCategory.KEY_AGREEMENT:
412 return False
413 m = re.match(r'PSA_ALG_KEY_AGREEMENT\(\w+,\s*(.*)\)\Z', self.expression)
414 if not m:
415 return False
416 kdf_alg = m.group(1)
417 # Assume kdf_alg is either a valid KDF or 0.
418 return not re.match(r'(?:0[Xx])?0+\s*\Z', kdf_alg)
419
Gilles Peskinee8e058c2022-03-17 23:42:25 +0100420
Gilles Peskine16b25062022-03-18 00:02:15 +0100421 def short_expression(self, level: int = 0) -> str:
Gilles Peskinee8e058c2022-03-17 23:42:25 +0100422 """Abbreviate the expression, keeping it human-readable.
423
424 See `crypto_knowledge.short_expression`.
425 """
Gilles Peskine16b25062022-03-18 00:02:15 +0100426 return short_expression(self.expression, level=level)
Gilles Peskinee8e058c2022-03-17 23:42:25 +0100427
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100428 HASH_LENGTH = {
429 'PSA_ALG_MD5': 16,
430 'PSA_ALG_SHA_1': 20,
431 }
432 HASH_LENGTH_BITS_RE = re.compile(r'([0-9]+)\Z')
433 @classmethod
434 def hash_length(cls, alg: str) -> int:
435 """The length of the given hash algorithm, in bytes."""
436 if alg in cls.HASH_LENGTH:
437 return cls.HASH_LENGTH[alg]
438 m = cls.HASH_LENGTH_BITS_RE.search(alg)
439 if m:
440 return int(m.group(1)) // 8
441 raise ValueError('Unknown hash length for ' + alg)
442
Gilles Peskinee3a08902022-03-19 10:37:33 +0100443 PERMITTED_TAG_LENGTHS = {
444 'PSA_ALG_CCM': frozenset([4, 6, 8, 10, 12, 14, 16]),
445 'PSA_ALG_CHACHA20_POLY1305': frozenset([16]),
446 'PSA_ALG_GCM': frozenset([4, 8, 12, 13, 14, 15, 16]),
447 }
448 MAC_LENGTH = {
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100449 'PSA_ALG_CBC_MAC': 16, # actually the block cipher length
450 'PSA_ALG_CMAC': 16, # actually the block cipher length
Gilles Peskinee3a08902022-03-19 10:37:33 +0100451 }
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100452 HMAC_RE = re.compile(r'PSA_ALG_HMAC\((.*)\)\Z')
Gilles Peskinee3a08902022-03-19 10:37:33 +0100453 @classmethod
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100454 def mac_or_tag_lengths(cls, base: str) -> FrozenSet[int]:
Gilles Peskinee3a08902022-03-19 10:37:33 +0100455 """Return the set of permitted lengths for the given MAC or AEAD tag."""
456 if base in cls.PERMITTED_TAG_LENGTHS:
457 return cls.PERMITTED_TAG_LENGTHS[base]
458 max_length = cls.MAC_LENGTH.get(base, None)
459 if max_length is None:
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100460 m = cls.HMAC_RE.match(base)
Gilles Peskinee3a08902022-03-19 10:37:33 +0100461 if m:
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100462 max_length = cls.hash_length(m.group(1))
Gilles Peskinee3a08902022-03-19 10:37:33 +0100463 if max_length is None:
464 raise ValueError('Unknown permitted lengths for ' + base)
465 return frozenset(range(4, max_length + 1))
466
467 TRUNCATED_ALG_RE = re.compile(
468 r'(?P<face>PSA_ALG_(?:AEAD_WITH_SHORTENED_TAG|TRUNCATED_MAC))'
469 r'\((?P<base>.*),'
470 r'(?P<length>0[Xx][0-9A-Fa-f]+|[1-9][0-9]*|0[0-9]*)[LUlu]*\)\Z')
471 def is_invalid_truncation(self) -> bool:
472 """False for a MAC or AEAD algorithm truncated to an invalid length.
473
474 True for a MAC or AEAD algorithm truncated to a valid length or to
475 a length that cannot be determined. True for anything other than
476 a truncated MAC or AEAD.
477 """
478 m = self.TRUNCATED_ALG_RE.match(self.expression)
479 if m:
480 base = m.group('base')
481 to_length = int(m.group('length'), 0)
Gilles Peskine4bd90dc2022-03-19 12:09:13 +0100482 permitted_lengths = self.mac_or_tag_lengths(base)
Gilles Peskinee3a08902022-03-19 10:37:33 +0100483 if to_length not in permitted_lengths:
484 return True
485 return False
486
Gilles Peskinea4013862021-04-29 20:54:40 +0200487 def can_do(self, category: AlgorithmCategory) -> bool:
Gilles Peskinee3a08902022-03-19 10:37:33 +0100488 """Whether this algorithm can perform operations in the given category.
489 """
Gilles Peskinea4013862021-04-29 20:54:40 +0200490 if category == self.category:
491 return True
492 if category == AlgorithmCategory.KEY_DERIVATION and \
493 self.is_key_agreement_with_derivation():
494 return True
495 return False
Gilles Peskinee6b85b42022-03-18 09:58:09 +0100496
497 def usage_flags(self, public: bool = False) -> List[str]:
498 """The list of usage flags describing operations that can perform this algorithm.
499
500 If public is true, only return public-key operations, not private-key operations.
501 """
502 if self.category == AlgorithmCategory.HASH:
503 flags = []
504 elif self.category == AlgorithmCategory.MAC:
505 flags = ['SIGN_HASH', 'SIGN_MESSAGE',
506 'VERIFY_HASH', 'VERIFY_MESSAGE']
507 elif self.category == AlgorithmCategory.CIPHER or \
508 self.category == AlgorithmCategory.AEAD:
509 flags = ['DECRYPT', 'ENCRYPT']
510 elif self.category == AlgorithmCategory.SIGN:
511 flags = ['VERIFY_HASH', 'VERIFY_MESSAGE']
512 if not public:
513 flags += ['SIGN_HASH', 'SIGN_MESSAGE']
514 elif self.category == AlgorithmCategory.ASYMMETRIC_ENCRYPTION:
515 flags = ['ENCRYPT']
516 if not public:
517 flags += ['DECRYPT']
518 elif self.category == AlgorithmCategory.KEY_DERIVATION or \
519 self.category == AlgorithmCategory.KEY_AGREEMENT:
520 flags = ['DERIVE']
521 else:
522 raise AlgorithmNotRecognized(self.expression)
523 return ['PSA_KEY_USAGE_' + flag for flag in flags]