psa_constant_names: support key agreement algorithms

This commit is contained in:
Gilles Peskine 2019-04-12 00:12:07 +02:00
parent a52460c3ed
commit 882e57ecba
3 changed files with 52 additions and 19 deletions

View File

@ -84,22 +84,21 @@ static void append_with_curve(char **buffer, size_t buffer_size,
append(buffer, buffer_size, required_size, ")", 1); append(buffer, buffer_size, required_size, ")", 1);
} }
static void append_with_hash(char **buffer, size_t buffer_size, typedef const char *(*psa_get_algorithm_name_func_ptr)(psa_algorithm_t alg);
static void append_with_alg(char **buffer, size_t buffer_size,
size_t *required_size, size_t *required_size,
const char *string, size_t length, psa_get_algorithm_name_func_ptr get_name,
psa_algorithm_t hash_alg) psa_algorithm_t alg)
{ {
const char *hash_name = psa_hash_algorithm_name(hash_alg); const char *name = get_name(alg);
append(buffer, buffer_size, required_size, string, length); if (name != NULL) {
append(buffer, buffer_size, required_size, "(", 1);
if (hash_name != NULL) {
append(buffer, buffer_size, required_size, append(buffer, buffer_size, required_size,
hash_name, strlen(hash_name)); name, strlen(name));
} else { } else {
append_integer(buffer, buffer_size, required_size, append_integer(buffer, buffer_size, required_size,
"0x%08lx", hash_alg); "0x%08lx", alg);
} }
append(buffer, buffer_size, required_size, ")", 1);
} }
#include "psa_constant_names_generated.c" #include "psa_constant_names_generated.c"

View File

@ -30,6 +30,14 @@ static const char *psa_hash_algorithm_name(psa_algorithm_t hash_alg)
} }
} }
static const char *psa_ka_algorithm_name(psa_algorithm_t ka_alg)
{
switch (ka_alg) {
%(ka_algorithm_cases)s
default: return NULL;
}
}
static int psa_snprint_key_type(char *buffer, size_t buffer_size, static int psa_snprint_key_type(char *buffer, size_t buffer_size,
psa_key_type_t type) psa_key_type_t type)
{ {
@ -47,12 +55,13 @@ static int psa_snprint_key_type(char *buffer, size_t buffer_size,
return (int) required_size; return (int) required_size;
} }
#define NO_LENGTH_MODIFIER 0xfffffffflu
static int psa_snprint_algorithm(char *buffer, size_t buffer_size, static int psa_snprint_algorithm(char *buffer, size_t buffer_size,
psa_algorithm_t alg) psa_algorithm_t alg)
{ {
size_t required_size = 0; size_t required_size = 0;
psa_algorithm_t core_alg = alg; psa_algorithm_t core_alg = alg;
unsigned long length_modifier = 0; unsigned long length_modifier = NO_LENGTH_MODIFIER;
if (PSA_ALG_IS_MAC(alg)) { if (PSA_ALG_IS_MAC(alg)) {
core_alg = PSA_ALG_TRUNCATED_MAC(alg, 0); core_alg = PSA_ALG_TRUNCATED_MAC(alg, 0);
if (core_alg != alg) { if (core_alg != alg) {
@ -70,6 +79,15 @@ static int psa_snprint_algorithm(char *buffer, size_t buffer_size,
"PSA_ALG_AEAD_WITH_TAG_LENGTH(", 29); "PSA_ALG_AEAD_WITH_TAG_LENGTH(", 29);
length_modifier = PSA_AEAD_TAG_LENGTH(alg); length_modifier = PSA_AEAD_TAG_LENGTH(alg);
} }
} else if (PSA_ALG_IS_KEY_AGREEMENT(alg) &&
!PSA_ALG_IS_RAW_KEY_AGREEMENT(alg)) {
core_alg = PSA_ALG_KEY_AGREEMENT_GET_KDF(alg);
append(&buffer, buffer_size, &required_size,
"PSA_ALG_KEY_AGREEMENT(", 22);
append_with_alg(&buffer, buffer_size, &required_size,
psa_ka_algorithm_name,
PSA_ALG_KEY_AGREEMENT_GET_BASE(alg));
append(&buffer, buffer_size, &required_size, ", ", 2);
} }
switch (core_alg) { switch (core_alg) {
%(algorithm_cases)s %(algorithm_cases)s
@ -81,9 +99,11 @@ static int psa_snprint_algorithm(char *buffer, size_t buffer_size,
break; break;
} }
if (core_alg != alg) { if (core_alg != alg) {
if (length_modifier != NO_LENGTH_MODIFIER) {
append(&buffer, buffer_size, &required_size, ", ", 2); append(&buffer, buffer_size, &required_size, ", ", 2);
append_integer(&buffer, buffer_size, &required_size, append_integer(&buffer, buffer_size, &required_size,
"%%lu", length_modifier); "%%lu", length_modifier);
}
append(&buffer, buffer_size, &required_size, ")", 1); append(&buffer, buffer_size, &required_size, ")", 1);
} }
buffer[0] = 0; buffer[0] = 0;
@ -126,9 +146,12 @@ key_type_from_curve_template = '''if (%(tester)s(type)) {
} else ''' } else '''
algorithm_from_hash_template = '''if (%(tester)s(core_alg)) { algorithm_from_hash_template = '''if (%(tester)s(core_alg)) {
append_with_hash(&buffer, buffer_size, &required_size, append(&buffer, buffer_size, &required_size,
"%(builder)s", %(builder_length)s, "%(builder)s(", %(builder_length)s + 1);
append_with_alg(&buffer, buffer_size, &required_size,
psa_hash_algorithm_name,
PSA_ALG_GET_HASH(core_alg)); PSA_ALG_GET_HASH(core_alg));
append(&buffer, buffer_size, &required_size, ")", 1);
} else ''' } else '''
bit_test_template = '''\ bit_test_template = '''\
@ -149,6 +172,7 @@ class MacroCollector:
self.ecc_curves = set() self.ecc_curves = set()
self.algorithms = set() self.algorithms = set()
self.hash_algorithms = set() self.hash_algorithms = set()
self.ka_algorithms = set()
self.algorithms_from_hash = {} self.algorithms_from_hash = {}
self.key_usages = set() self.key_usages = set()
@ -193,6 +217,9 @@ class MacroCollector:
# Ad hoc detection of hash algorithms # Ad hoc detection of hash algorithms
if re.search(r'0x010000[0-9A-Fa-f]{2}', definition): if re.search(r'0x010000[0-9A-Fa-f]{2}', definition):
self.hash_algorithms.add(name) self.hash_algorithms.add(name)
# Ad hoc detection of key agreement algorithms
if re.search(r'0x30[0-9A-Fa-f]{2}0000', definition):
self.ka_algorithms.add(name)
elif name.startswith('PSA_ALG_') and parameter == 'hash_alg': elif name.startswith('PSA_ALG_') and parameter == 'hash_alg':
if name in ['PSA_ALG_DSA', 'PSA_ALG_ECDSA']: if name in ['PSA_ALG_DSA', 'PSA_ALG_ECDSA']:
# A naming irregularity # A naming irregularity
@ -256,6 +283,10 @@ class MacroCollector:
return '\n '.join(map(self.make_return_case, return '\n '.join(map(self.make_return_case,
sorted(self.hash_algorithms))) sorted(self.hash_algorithms)))
def make_ka_algorithm_cases(self):
return '\n '.join(map(self.make_return_case,
sorted(self.ka_algorithms)))
def make_algorithm_cases(self): def make_algorithm_cases(self):
return '\n '.join(map(self.make_append_case, return '\n '.join(map(self.make_append_case,
sorted(self.algorithms))) sorted(self.algorithms)))
@ -281,6 +312,7 @@ class MacroCollector:
data['key_type_cases'] = self.make_key_type_cases() data['key_type_cases'] = self.make_key_type_cases()
data['key_type_code'] = self.make_key_type_code() data['key_type_code'] = self.make_key_type_code()
data['hash_algorithm_cases'] = self.make_hash_algorithm_cases() data['hash_algorithm_cases'] = self.make_hash_algorithm_cases()
data['ka_algorithm_cases'] = self.make_ka_algorithm_cases()
data['algorithm_cases'] = self.make_algorithm_cases() data['algorithm_cases'] = self.make_algorithm_cases()
data['algorithm_code'] = self.make_algorithm_code() data['algorithm_code'] = self.make_algorithm_code()
data['key_usage_code'] = self.make_key_usage_code() data['key_usage_code'] = self.make_key_usage_code()

View File

@ -63,7 +63,8 @@ when applicable.'''
# Hard-coded value for unknown algorithms # Hard-coded value for unknown algorithms
self.hash_algorithms = set(['0x010000fe']) self.hash_algorithms = set(['0x010000fe'])
self.mac_algorithms = set(['0x02ff00ff']) self.mac_algorithms = set(['0x02ff00ff'])
self.kdf_algorithms = set(['0x300000ff', '0x310000ff']) self.ka_algorithms = set(['0x30fc0000'])
self.kdf_algorithms = set(['0x200000ff'])
# For AEAD algorithms, the only variability is over the tag length, # For AEAD algorithms, the only variability is over the tag length,
# and this only applies to known algorithms, so don't test an # and this only applies to known algorithms, so don't test an
# unknown algorithm. # unknown algorithm.
@ -89,6 +90,7 @@ when applicable.'''
Call this after parsing all the inputs.''' Call this after parsing all the inputs.'''
self.arguments_for['hash_alg'] = sorted(self.hash_algorithms) self.arguments_for['hash_alg'] = sorted(self.hash_algorithms)
self.arguments_for['mac_alg'] = sorted(self.mac_algorithms) self.arguments_for['mac_alg'] = sorted(self.mac_algorithms)
self.arguments_for['ka_alg'] = sorted(self.ka_algorithms)
self.arguments_for['kdf_alg'] = sorted(self.kdf_algorithms) self.arguments_for['kdf_alg'] = sorted(self.kdf_algorithms)
self.arguments_for['aead_alg'] = sorted(self.aead_algorithms) self.arguments_for['aead_alg'] = sorted(self.aead_algorithms)
self.arguments_for['curve'] = sorted(self.ecc_curves) self.arguments_for['curve'] = sorted(self.ecc_curves)