d/numam-dpdk
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

crypto/qat: add modular multiplicative inverse

Browse Source 
This commit adds modular multiplicative inverse to Intel
QuickAssist Technology driver. For capabilities or limitations
please refer to qat.rst or qat_asym_capabilities.h.

Signed-off-by: Arek Kusztal <arkadiuszx.kusztal@intel.com>
Acked-by: Fiona Trahe <fiona.trahe@intel.com>
This commit is contained in:
Arek Kusztal 2019-03-28 14:37:03 +01:00 committed by Akhil Goyal
parent fb70b33b05
commit 8245972c04
5 changed files with 106 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
doc/guides/cryptodevs/qat.rst
View File

@ -107,6 +107,7 @@ Asymmetric Crypto Service on QAT
The QAT Asym PMD has support for:
* ``Modular exponentiation``
* ``Modular multiplicative inverse``
Limitations
~~~~~~~~~~~

4
drivers/common/qat/qat_adf/qat_pke_functionality_arrays.h
View File

@ -21,7 +21,7 @@ static const uint32_t MOD_EXP_SIZE[][2] = {
{ 4096, MATHS_MODEXP_L4096 }
};
static const uint32_t __rte_unused MOD_INV_IDS_ODD[][2] = {
static const uint32_t MOD_INV_IDS_ODD[][2] = {
{ 128, MATHS_MODINV_ODD_L128 },
{ 192, MATHS_MODINV_ODD_L192 },
{ 256, MATHS_MODINV_ODD_L256 },
@ -35,7 +35,7 @@ static const uint32_t __rte_unused MOD_INV_IDS_ODD[][2] = {
{ 4096, MATHS_MODINV_ODD_L4096 },
};
static const uint32_t __rte_unused MOD_INV_IDS_EVEN[][2] = {
static const uint32_t MOD_INV_IDS_EVEN[][2] = {
{ 128, MATHS_MODINV_EVEN_L128 },
{ 192, MATHS_MODINV_EVEN_L192 },
{ 256, MATHS_MODINV_EVEN_L256 },

85
drivers/crypto/qat/qat_asym.c
View File

@ -54,6 +54,9 @@ static void qat_asym_build_req_tmpl(void *sess_private_data,
if (xform->xform_type == RTE_CRYPTO_ASYM_XFORM_MODEX) {
qat_req->output_param_count = 1;
qat_req->input_param_count = 3;
} else if (xform->xform_type == RTE_CRYPTO_ASYM_XFORM_MODINV) {
qat_req->output_param_count = 1;
qat_req->input_param_count = 2;
}
}
@ -147,7 +150,8 @@ qat_asym_build_request(void *in_op,
if (ctx->alg == QAT_PKE_MODEXP) {
err = qat_asym_check_nonzero(ctx->sess_alg_params.mod_exp.n);
if (err) {
QAT_LOG(ERR, "Empty modulus, aborting this operation");
QAT_LOG(ERR, "Empty modulus in modular exponentiation,"
" aborting this operation");
goto error;
}
@ -188,6 +192,56 @@ qat_asym_build_request(void *in_op,
QAT_DP_HEXDUMP_LOG(DEBUG, "modulus",
cookie->input_array[2],
alg_size_in_bytes);
#endif
} else if (ctx->alg == QAT_PKE_MODINV) {
err = qat_asym_check_nonzero(ctx->sess_alg_params.mod_inv.n);
if (err) {
QAT_LOG(ERR, "Empty modulus in modular multiplicative"
" inverse, aborting this operation");
goto error;
}
alg_size_in_bytes = max_of(2, asym_op->modinv.base.length,
ctx->sess_alg_params.mod_inv.n.length);
alg_size = alg_size_in_bytes << 3;
if (ctx->sess_alg_params.mod_inv.n.data[
ctx->sess_alg_params.mod_inv.n.length - 1] & 0x01) {
if (qat_asym_get_sz_and_func_id(MOD_INV_IDS_ODD,
sizeof(MOD_INV_IDS_ODD)/
sizeof(*MOD_INV_IDS_ODD),
&alg_size, &func_id)) {
err = QAT_ASYM_ERROR_INVALID_PARAM;
goto error;
}
} else {
if (qat_asym_get_sz_and_func_id(MOD_INV_IDS_EVEN,
sizeof(MOD_INV_IDS_EVEN)/
sizeof(*MOD_INV_IDS_EVEN),
&alg_size, &func_id)) {
err = QAT_ASYM_ERROR_INVALID_PARAM;
goto error;
}
}
alg_size_in_bytes = alg_size >> 3;
rte_memcpy(cookie->input_array[0] + alg_size_in_bytes -
asym_op->modinv.base.length
, asym_op->modinv.base.data,
asym_op->modinv.base.length);
rte_memcpy(cookie->input_array[1] + alg_size_in_bytes -
ctx->sess_alg_params.mod_inv.n.length
, ctx->sess_alg_params.mod_inv.n.data,
ctx->sess_alg_params.mod_inv.n.length);
cookie->alg_size = alg_size;
qat_req->pke_hdr.cd_pars.func_id = func_id;
#if RTE_LOG_DP_LEVEL >= RTE_LOG_DEBUG
QAT_DP_HEXDUMP_LOG(DEBUG, "base",
cookie->input_array[0],
alg_size_in_bytes);
QAT_DP_HEXDUMP_LOG(DEBUG, "modulus",
cookie->input_array[1],
alg_size_in_bytes);
#endif
}
@ -262,6 +316,26 @@ qat_asym_process_response(void **op, uint8_t *resp,
}
qat_clear_arrays(cookie, 3, 1, alg_size_in_bytes,
alg_size_in_bytes);
} else if (ctx->alg == QAT_PKE_MODINV) {
alg_size = cookie->alg_size;
alg_size_in_bytes = alg_size >> 3;
uint8_t *modinv_result = asym_op->modinv.result.data;
if (rx_op->status == RTE_CRYPTO_OP_STATUS_NOT_PROCESSED) {
rte_memcpy(modinv_result + (asym_op->modinv.result.length
- ctx->sess_alg_params.mod_inv.n.length),
cookie->output_array[0] + alg_size_in_bytes
- ctx->sess_alg_params.mod_inv.n.length,
ctx->sess_alg_params.mod_inv.n.length);
rx_op->status = RTE_CRYPTO_OP_STATUS_SUCCESS;
#if RTE_LOG_DP_LEVEL >= RTE_LOG_DEBUG
QAT_DP_HEXDUMP_LOG(DEBUG, "modinv_result",
cookie->output_array[0],
alg_size_in_bytes);
#endif
}
qat_clear_arrays(cookie, 2, 1, alg_size_in_bytes,
alg_size_in_bytes);
}
#if RTE_LOG_DP_LEVEL >= RTE_LOG_DEBUG
@ -298,6 +372,15 @@ qat_asym_session_configure(struct rte_cryptodev *dev,
err = -EINVAL;
goto error;
}
} else if (xform->xform_type == RTE_CRYPTO_ASYM_XFORM_MODINV) {
session->sess_alg_params.mod_inv.n = xform->modinv.modulus;
session->alg = QAT_PKE_MODINV;
if (xform->modinv.modulus.length == 0) {
QAT_LOG(ERR, "Invalid mod inv input parameter");
err = -EINVAL;
goto error;
}
} else {
QAT_LOG(ERR, "Invalid asymmetric crypto xform");
err = -EINVAL;

3
drivers/crypto/qat/qat_asym.h
View File

@ -50,6 +50,9 @@ struct qat_asym_session {
rte_crypto_param n;
rte_crypto_param e;
} mod_exp;
struct {
rte_crypto_param n;
} mod_inv;
} sess_alg_params;
};

16
drivers/crypto/qat/qat_asym_capabilities.h
View File

@ -21,6 +21,22 @@
} \
}, \
} \
}, \
{ /* modinv */ \
.op = RTE_CRYPTO_OP_TYPE_ASYMMETRIC, \
{.asym = { \
.xform_capa = { \
.xform_type = RTE_CRYPTO_ASYM_XFORM_MODINV, \
.op_types = 0, \
{ \
.modlen = { \
.min = 1, \
.max = 512, \
.increment = 1 \
}, } \
} \
}, \
} \
} \
#endif /* _QAT_ASYM_CAPABILITIES_H_ */